000 03750nam a22005895i 4500
001 978-3-540-30540-8
003 DE-He213
005 20240730202834.0
007 cr nn 008mamaa
008 110116s2005 gw | s |||| 0|eng d
020 _a9783540305408
_9978-3-540-30540-8
024 7 _a10.1007/b105263
_2doi
050 4 _aT385
072 7 _aUML
_2bicssc
072 7 _aCOM012000
_2bisacsh
072 7 _aUML
_2thema
082 0 4 _a006.6
_223
245 1 0 _aCombinatorial Geometry and Graph Theory
_h[electronic resource] :
_bIndonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers /
_cedited by Jin Akiyama, Edy Tri Baskoro, Mikio Kano.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aVIII, 227 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3330
505 0 _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.
650 0 _aComputer graphics.
_94088
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aAlgorithms.
_93390
650 0 _aArtificial intelligence
_xData processing.
_921787
650 1 4 _aComputer Graphics.
_94088
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aAlgorithms.
_93390
650 2 4 _aData Science.
_934092
700 1 _aAkiyama, Jin.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9173296
700 1 _aBaskoro, Edy Tri.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9173297
700 1 _aKano, Mikio.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9173298
710 2 _aSpringerLink (Online service)
_9173299
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540244011
776 0 8 _iPrinted edition:
_z9783540807070
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3330
_9173300
856 4 0 _uhttps://doi.org/10.1007/b105263
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c97206
_d97206