03992nam 22007095 450 99646602070331620230222074240.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)99100000000021269420110116d2005 u| 0engurnn|008mamaatxtccrCombinatorial Geometry and Graph Theory[electronic resource] Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers /edited by Jin Akiyama, Edy Tri Baskoro, Mikio Kano1st ed. 2005.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2005.1 online resource (VIII, 227 p.) Theoretical Computer Science and General Issues,2512-2029 ;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.Theoretical Computer Science and General Issues,2512-2029 ;3330Computer graphicsComputer science—MathematicsDiscrete mathematicsAlgorithmsArtificial intelligence—Data processingComputer GraphicsDiscrete Mathematics in Computer ScienceAlgorithmsData ScienceComputer graphics.Computer science—Mathematics.Discrete mathematics.Algorithms.Artificial intelligence—Data processing.Computer Graphics.Discrete Mathematics in Computer Science.Algorithms.Data Science.516/.13Akiyama Jinedthttp://id.loc.gov/vocabulary/relators/edtBaskoro Edy Triedthttp://id.loc.gov/vocabulary/relators/edtKano Mikioedthttp://id.loc.gov/vocabulary/relators/edtBOOK996466020703316Combinatorial Geometry and Graph Theory772668UNISA