Combinatorial Geometry and Graph Theory Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers /

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Akiyama, Jin (Editor ), Baskoro, Edy Tri (Editor ), Kano, Mikio (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
Edición:1st ed. 2005.
Colección:Theoretical Computer Science and General Issues, 3330
Temas:
Computer graphics.
Computer science > Mathematics.
Discrete mathematics.
Algorithms.
Artificial intelligence > Data processing.
Computer Graphics.
Discrete Mathematics in Computer Science.
Data Science.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares