1 option
Combinatorial Geometry and Graph Theory : Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers / edited by Jin Akiyama, Edy Tri Baskoro, Mikio Kano.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 3330.
- Theoretical Computer Science and General Issues ; 3330
- Language:
- English
- Subjects (All):
- Computer graphics.
- Computer science--Mathematics.
- Computer science.
- Algorithms.
- Data structures (Computer science).
- Computer Graphics.
- Discrete Mathematics in Computer Science.
- Algorithm Analysis and Problem Complexity.
- Data Structures.
- Local Subjects:
- Computer Graphics.
- Discrete Mathematics in Computer Science.
- Algorithm Analysis and Problem Complexity.
- Data Structures.
- Physical Description:
- 1 online resource (VIII, 227 pages).
- Edition:
- First edition 2005.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
- System Details:
- text file PDF
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-30540-8
- 9783540305408
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.