This book constitutes the thoroughly refereed post-proceedings of the Indonesia-Japan Joint Conference on Combinatorial Geometry and Graph Theory, IJCCGGT 2003, held in Bandung, Indonesia in September 2003.
The 23 revised papers presented were carefully selected during two rounds of reviewing and improvement. Among the topics covered are coverings, convex polygons, convex polyhedra, matchings, graph colourings, crossing numbers, subdivision numbers, combinatorial optimization, combinatorics, spanning trees, various graph characteristica, convex bodies, labelling, Ramsey number estimation, etc.
Author(s): Jin Akiyama, Koichi Hirata (auth.), Jin Akiyama, Edy Tri Baskoro, Mikio Kano (eds.)
Series: Lecture Notes in Computer Science 3330 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2005
Language: English
Pages: 227
Tags: Computer Graphics; Discrete Mathematics in Computer Science; Algorithm Analysis and Problem Complexity; Data Structures
Front Matter....Pages -
On Convex Developments of a Doubly-Covered Square....Pages 1-13
Flat 2-Foldings of Convex Polygons....Pages 14-24
Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph....Pages 25-33
Foldings of Regular Polygons to Convex Polyhedra I: Equilateral Triangles....Pages 34-43
Maximum Induced Matchings of Random Regular Graphs....Pages 44-57
Antimagic Valuations for the Special Class of Plane Graphs....Pages 58-64
A General Framework for Coloring Problems: Old Results, New Results, and Open Problems....Pages 65-79
Crossing Numbers and Skewness of Some Generalized Petersen Graphs....Pages 80-86
Some Conditions for the Existence of ( d , k )-Digraphs....Pages 87-93
Subdivision Number of Large Complete Graphs and Large Complete Multipartite Graphs....Pages 94-101
On a Triangle with the Maximum Area in a Planar Point Set....Pages 102-107
A Balanced Interval of Two Sets of Points on a Line....Pages 108-112
Spanning Trees of Multicoloured Point Sets with Few Intersections....Pages 113-122
Regular Factors Containing a Given Hamiltonian Cycle....Pages 123-132
Disjoint Edges in Topological Graphs....Pages 133-140
The Decycling Number of Cubic Graphs....Pages 141-145
Equal Area Polygons in Convex Bodies....Pages 146-158
Maximum Order of Planar Digraphs....Pages 159-168
( a , d )-Edge-Antimagic Total Labelings of Caterpillars....Pages 169-180
An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels....Pages 181-184
Constructions for Nonhamiltonian Burkard-Hammer Graphs....Pages 185-199
A Characterization of Polygonal Regions Searchable from the Boundary....Pages 200-215
Δ-Optimum Exclusive Sum Labeling of Certain Graphs with Radius One....Pages 216-225
Back Matter....Pages -
