Bültmann & Gerriets
Combinatorial Geometry and Graph Theory
Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers
von Jin Akiyama, Edy Tri Baskoro, Mikio Kano
Verlag: Springer Berlin Heidelberg
Reihe: Lecture Notes in Computer Science Nr. 3330
Reihe: Theoretical Computer Science and General Issues
E-Book / PDF
Kopierschutz: PDF mit Wasserzeichen

Hinweis: Nach dem Checkout (Kasse) wird direkt ein Link zum Download bereitgestellt. Der Link kann dann auf PC, Smartphone oder E-Book-Reader ausgeführt werden.
E-Books können per PayPal bezahlt werden. Wenn Sie E-Books per Rechnung bezahlen möchten, kontaktieren Sie uns bitte.

ISBN: 978-3-540-30540-8
Auflage: 2005
Erschienen am 18.01.2005
Sprache: Englisch
Umfang: 227 Seiten

Preis: 53,49 €

53,49 €
merken
zum Hardcover 53,49 €
Inhaltsverzeichnis

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.


andere Formate
weitere Titel der Reihe