LEADER 03963nam  22007095  450 
001 9910483030203321
005 20230810201341.0
010   $a3-540-30540-8
010   $a3-540-24401-8
024 7 $a10.1007/b105263
035   $a(CKB)1000000000212694
035   $a(SSID)ssj0000316683
035   $a(PQKBManifestationID)11237033
035   $a(PQKBTitleCode)TC0000316683
035   $a(PQKBWorkID)10275150
035   $a(PQKB)11080724
035   $a(DE-He213)978-3-540-30540-8
035   $a(MiAaPQ)EBC3068295
035   $a(PPN)12309139X
035   $a(EXLCZ)991000000000212694
100   $a20110116d2005      u|         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aCombinatorial Geometry and Graph Theory $eIndonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers /$fedited by Jin Akiyama, Edy Tri Baskoro, Mikio Kano
205   $a1st ed. 2005.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005.
215   $a1 online resource (VIII, 227 p.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3330
300   $aBibliographic Level Mode of Issuance: Monograph
311 08$aPrinted edition: 9783540244011 
320   $aIncludes bibliographical references and index.
327   $aOn 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3330
606   $aComputer graphics
606   $aComputer science$xMathematics
606   $aDiscrete mathematics
606   $aAlgorithms
606   $aArtificial intelligence$xData processing
606   $aComputer Graphics
606   $aDiscrete Mathematics in Computer Science
606   $aAlgorithms
606   $aData Science
615  0$aComputer graphics.
615  0$aComputer science$xMathematics.
615  0$aDiscrete mathematics.
615  0$aAlgorithms.
615  0$aArtificial intelligence$xData processing.
615 14$aComputer Graphics.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aAlgorithms.
615 24$aData Science.
676   $a516/.13
702   $aAkiyama$b Jin$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aBaskoro$b Edy Tri$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aKano$b Mikio$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a9910483030203321
996   $aCombinatorial Geometry and Graph Theory$9772668
997   $aUNINA