03322nam 2200589 a 450 991048303020332120200520144314.03-540-30540-83-540-24401-810.1007/b105263(CKB)1000000000212694(SSID)ssj0000316683(PQKBManifestationID)11237033(PQKBTitleCode)TC0000316683(PQKBWorkID)10275150(PQKB)11080724(DE-He213)978-3-540-30540-8(MiAaPQ)EBC3068295(PPN)12309139X(EXLCZ)99100000000021269420041214d2005 uy 0engurnn|008mamaatxtccrCombinatorial geometry and graph theory Indonesia-Japan joint conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003 : revised selected papers /Jin Akiyama, Edy Tri Baskoro, Mikio Kano (eds.)1st ed. 2005.Berlin ;New York Springerc20051 online resource (VIII, 227 p.) Lecture notes in computer science,0302-9743 ;3330Bibliographic Level Mode of Issuance: MonographPrinted edition: 9783540244011 Includes bibliographical references and index.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.Lecture notes in computer science ;3330.IJCCGGT 2003Combinatorial geometryCongressesGraph theoryCongressesCombinatorial geometryGraph theory516/.13Akiyama J1609637Baskoro Edy Tri1756890Kano Mikio1949-512838MiAaPQMiAaPQMiAaPQBOOK9910483030203321Combinatorial geometry and graph theory4194417UNINA