|
|
|
|
| LEADER |
03313nam a22005295i 4500 |
| 001 |
978-3-540-30540-8 |
| 003 |
DE-He213 |
| 005 |
20151030041509.0 |
| 007 |
cr nn 008mamaa |
| 008 |
110116s2005 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540305408
|9 978-3-540-30540-8
|
| 024 |
7 |
|
|a 10.1007/b105263
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a T385
|
| 072 |
|
7 |
|a UML
|2 bicssc
|
| 072 |
|
7 |
|a COM012000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 006.6
|2 23
|
| 245 |
1 |
0 |
|a Combinatorial Geometry and Graph Theory
|h [electronic resource] :
|b Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers /
|c edited by Jin Akiyama, Edy Tri Baskoro, Mikio Kano.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2005.
|
| 300 |
|
|
|a VIII, 227 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3330
|
| 505 |
0 |
|
|a 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.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Data structures (Computer science).
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Computer graphics.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Computer Graphics.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Data Structures.
|
| 700 |
1 |
|
|a Akiyama, Jin.
|e editor.
|
| 700 |
1 |
|
|a Baskoro, Edy Tri.
|e editor.
|
| 700 |
1 |
|
|a Kano, Mikio.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540244011
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 3330
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/b105263
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
