Combinatorial Geometry and Graph Theory
Akiyama, Jin.
Combinatorial Geometry and Graph Theory Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers / [electronic resource] : edited by Jin Akiyama, Edy Tri Baskoro, Mikio Kano. - VIII, 227 p. Also available online. online resource. - Lecture Notes in Computer Science, 3330 0302-9743 ; . - Lecture Notes in Computer Science, 3330 .
On Convex Developments of a Doubly-Covered Square -- Flat 2-Foldings of Convex Polygons -- Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph -- Foldings of Regular Polygons to Convex Polyhedra I: Equilateral Triangles -- Maximum Induced Matchings of Random Regular Graphs -- Antimagic Valuations for the Special Class of Plane Graphs -- A General Framework for Coloring Problems: Old Results, New Results, and Open Problems -- Crossing Numbers and Skewness of Some Generalized Petersen Graphs -- Some Conditions for the Existence of (d,k)-Digraphs -- Subdivision Number of Large Complete Graphs and Large Complete Multipartite Graphs -- On a Triangle with the Maximum Area in a Planar Point Set -- A Balanced Interval of Two Sets of Points on a Line -- Spanning Trees of Multicoloured Point Sets with Few Intersections -- Regular Factors Containing a Given Hamiltonian Cycle -- Disjoint Edges in Topological Graphs -- The Decycling Number of Cubic Graphs -- Equal Area Polygons in Convex Bodies -- Maximum Order of Planar Digraphs -- (a,d)-Edge-Antimagic Total Labelings of Caterpillars -- An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels -- Constructions for Nonhamiltonian Burkard-Hammer Graphs -- A Characterization of Polygonal Regions Searchable from the Boundary -- ?-Optimum Exclusive Sum Labeling of Certain Graphs with Radius One.
9783540305408
10.1007/b105263 doi
Computer science.
Data structures (Computer science).
Computer software.
Computational complexity.
Computer graphics.
Computer Science.
Computer Graphics.
Discrete Mathematics in Computer Science.
Algorithm Analysis and Problem Complexity.
Data Structures.
T385
006.6
Combinatorial Geometry and Graph Theory Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers / [electronic resource] : edited by Jin Akiyama, Edy Tri Baskoro, Mikio Kano. - VIII, 227 p. Also available online. online resource. - Lecture Notes in Computer Science, 3330 0302-9743 ; . - Lecture Notes in Computer Science, 3330 .
On Convex Developments of a Doubly-Covered Square -- Flat 2-Foldings of Convex Polygons -- Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph -- Foldings of Regular Polygons to Convex Polyhedra I: Equilateral Triangles -- Maximum Induced Matchings of Random Regular Graphs -- Antimagic Valuations for the Special Class of Plane Graphs -- A General Framework for Coloring Problems: Old Results, New Results, and Open Problems -- Crossing Numbers and Skewness of Some Generalized Petersen Graphs -- Some Conditions for the Existence of (d,k)-Digraphs -- Subdivision Number of Large Complete Graphs and Large Complete Multipartite Graphs -- On a Triangle with the Maximum Area in a Planar Point Set -- A Balanced Interval of Two Sets of Points on a Line -- Spanning Trees of Multicoloured Point Sets with Few Intersections -- Regular Factors Containing a Given Hamiltonian Cycle -- Disjoint Edges in Topological Graphs -- The Decycling Number of Cubic Graphs -- Equal Area Polygons in Convex Bodies -- Maximum Order of Planar Digraphs -- (a,d)-Edge-Antimagic Total Labelings of Caterpillars -- An Upper Bound for the Ramsey Number of a Cycle of Length Four Versus Wheels -- Constructions for Nonhamiltonian Burkard-Hammer Graphs -- A Characterization of Polygonal Regions Searchable from the Boundary -- ?-Optimum Exclusive Sum Labeling of Certain Graphs with Radius One.
9783540305408
10.1007/b105263 doi
Computer science.
Data structures (Computer science).
Computer software.
Computational complexity.
Computer graphics.
Computer Science.
Computer Graphics.
Discrete Mathematics in Computer Science.
Algorithm Analysis and Problem Complexity.
Data Structures.
T385
006.6