Franklin

Discrete Geometry, Combinatorics and Graph Theory [electronic resource] : 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, and Xi'an, China, November 22-24, 2005, Revised Selected Papers / edited by Jin Akiyama, William Y.C. Chen, Mikio Kano, Xueliang Li, Qinglin Yu.

Edition:
1st ed. 2007.
Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
Series:
Computer Science (Springer-11645)
LNCS sublibrary. Theoretical computer science and general issues SL 1, 4381
Theoretical Computer Science and General Issues ; 4381
Format/Description:
Book
1 online resource (XI, 289 pages)
Subjects:
Computer science-Mathematics.
Computer graphics.
Algorithms.
Data structures (Computer science).
Convex geometry.
Discrete geometry.
Local subjects:
Discrete Mathematics in Computer Science. (search)
Computer Graphics. (search)
Algorithm Analysis and Problem Complexity. (search)
Data Structures. (search)
Convex and Discrete Geometry. (search)
System Details:
text file PDF
Contents:
Infinite Series of Generalized Gosper Space Filling Curves
Contractible Edges in a k-Connected Graph
An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs
On the Choice Numbers of Some Complete Multipartite Graphs
On Convex Quadrangulations of Point Sets on the Plane
Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs
Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order
A Neighborhood Condition for Graphs to Have [a, b]-Factors III
General Balanced Subdivision of Two Sets of Points in the Plane
Coverage Problem of Wireless Sensor Networks
Some Topics on Edge-Coloring
Hamiltonicity of Complements of Total Graphs
Isolated Toughness and Existence of f-Factors
A Note on the Integrity of Middle Graphs
Indecomposable Coverings
The Decycling Number of Cubic Planar Graphs
Quasilocally Connected, Almost Locally Connected Or Triangularly Connected Claw-Free Graphs
Rotational Steiner Ratio Problem Under Uniform Orientation Metrics
Two Classes of Simple MCD Graphs
Core Stability of Flow Games
The (Adjacent) Vertex-Distinguishing Total Coloring of the Mycielski Graphs and the Cartesian Product Graphs
Three Classes of Bipartite Integral Graphs
Reconfirmation of Two Results on Disjoint Empty Convex Polygons
The Binding Number of a Digraph
The Kauffman Bracket Polynomial of Links and Universal Signed Plane Graph
Fractional Vertex Arboricity of Graphs
Fitting Triangles into Rectangles
Regular Coronoids and Ear Decompositions of Plane Elementary Bipartite Graphs
On the Upper Chromatic Numbers of Mixed Interval Hypertrees
Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs.
Contributor:
Akiyama, J., editor., Editor,
Chen, William Y.C. editor., Editor,
Kano, Mikio. editor., Editor,
Li, Xueliang, editor., Editor,
Yu, Qinglin. editor., Editor,
SpringerLink (Online service)
Contained In:
Springer eBooks
Other format:
Printed edition:
Printed edition:
ISBN:
978-3-540-70666-3
9783540706663
Publisher Number:
10.1007/978-3-540-70666-3 doi
Access Restriction:
Restricted for use by site license.
Loading...
Location Notes Your Loan Policy
Description Status Barcode Your Loan Policy