|
![]() |
|||
|
||||
OverviewThis 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. Full Product DetailsAuthor: Jin Akiyama , Edy Tri Baskoro , Mikio KanoPublisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K Edition: 2005 ed. Volume: 3330 Dimensions: Width: 15.50cm , Height: 1.20cm , Length: 23.50cm Weight: 0.760kg ISBN: 9783540244011ISBN 10: 3540244018 Pages: 227 Publication Date: 31 January 2005 Audience: College/higher education , Professional and scholarly , Postgraduate, Research & Scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: In Print ![]() This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us. Table of ContentsOn 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.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |