Discrete Geometry, Combinatorics and Graph Theory 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, Xi’an, China, November 22-24, 2005, Revised Selected Papers
by
 
Akiyama, Jin. editor.

Title
Discrete Geometry, Combinatorics and Graph Theory 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, Xi’an, China, November 22-24, 2005, Revised Selected Papers

Author
Akiyama, Jin. editor.

ISBN
9783540706663

Physical Description
XI, 289 p. Also available online. online resource.

Series
Lecture Notes in Computer Science, 4381

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.

Subject Term
Computer science.
 
Data structures (Computer science).
 
Computer software.
 
Computational complexity.
 
Computer graphics.
 
Discrete groups.
 
Discrete Mathematics in Computer Science.
 
Algorithm Analysis and Problem Complexity.
 
Data Structures.
 
Convex and Discrete Geometry.

Added Author
Akiyama, Jin.
 
Chen, William Y. C.
 
Kano, Mikio.
 
Li, Xueliang.
 
Yu, Qinglin.

Added Corporate Author
SpringerLink (Online service)

Electronic Access
http://dx.doi.org/10.1007/978-3-540-70666-3


LibraryMaterial TypeItem BarcodeShelf NumberStatus
IYTE LibraryE-Book512219-1001QA76.9 .M35 Online Springer