Combinatorial Geometry and Graph Theory

Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers

  • Jin Akiyama
  • Edy Tri Baskoro
  • Mikio Kano
Conference proceedings IJCCGGT 2003

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3330)

Table of contents

  1. Front Matter
    PDF
  2. On Convex Developments of a Doubly-Covered Square
    Jin Akiyama, Koichi Hirata
    Pages 1-13
  3. Flat 2-Foldings of Convex Polygons
    Jin Akiyama, Koichi Hirata, Mari-Jo P. Ruiz, Jorge Urrutia
    Pages 14-24
  4. Uniform Coverings of 2-Paths with 6-Paths in the Complete Graph
    Jin Akiyama, Midori Kobayashi, Gisaku Nakamura
    Pages 25-33
  5. Foldings of Regular Polygons to Convex Polyhedra I: Equilateral Triangles
    Jin Akiyama, Gisaku Nakamura
    Pages 34-43
  6. Maximum Induced Matchings of Random Regular Graphs
    Hilda Assiyatun
    Pages 44-57
  7. Antimagic Valuations for the Special Class of Plane Graphs
    Martin Bača, Edy Tri Baskoro, Mirka Miller
    Pages 58-64
  8. A General Framework for Coloring Problems: Old Results, New Results, and Open Problems
    Hajo Broersma
    Pages 65-79
  9. Crossing Numbers and Skewness of Some Generalized Petersen Graphs
    G. L. Chia, C. L. Lee
    Pages 80-86
  10. Some Conditions for the Existence of (d,k)-Digraphs
    Yus Mochamad Cholily, Edy Tri Baskoro, Saladin Uttunggadewa
    Pages 87-93
  11. Subdivision Number of Large Complete Graphs and Large Complete Multipartite Graphs
    Severino V. Gervacio
    Pages 94-101
  12. On a Triangle with the Maximum Area in a Planar Point Set
    Kiyoshi Hosono, Ferran Hurtado, Masatsugu Urabe, Jorge Urrutia
    Pages 102-107
  13. A Balanced Interval of Two Sets of Points on a Line
    Atsushi Kaneko, M. Kano
    Pages 108-112
  14. Spanning Trees of Multicoloured Point Sets with Few Intersections
    J. Leaños, C. Merino, G. Salazar, J. Urrutia
    Pages 113-122
  15. Regular Factors Containing a Given Hamiltonian Cycle
    Haruhide Matsuda
    Pages 123-132
  16. Disjoint Edges in Topological Graphs
    János Pach, Géza Tóth
    Pages 133-140
  17. The Decycling Number of Cubic Graphs
    Narong Punnim
    Pages 141-145
  18. Equal Area Polygons in Convex Bodies
    T. Sakai, C. Nara, J. Urrutia
    Pages 146-158
  19. Maximum Order of Planar Digraphs
    Rinovia Simanjuntak, Mirka Miller
    Pages 159-168
  20. (a,d)-Edge-Antimagic Total Labelings of Caterpillars
    K. A. Sugeng, M. Miller, Slamin, M. Bača
    Pages 169-180

About these proceedings

Keywords

Graph Graph theory Hamiltonian cycle Matching algorithmic geometry combinatorial optimization computational discrete mathematics computational geometry computational graph theory convex geometry geometric computations graph algorithms graph computations optimization polygon computations

Editors and affiliations

  • Jin Akiyama
    • 1
  • Edy Tri Baskoro
    • 2
  • Mikio Kano
    • 3
  1. 1.Research Institute of EducationTokai UniversityTokioJapan
  2. 2.Department of MathematicsInstitut Teknologi Bandung (ITB)Indonesia
  3. 3.Ibaraki University, Nakanarusawa, HitachiIbarakiJapan

Bibliographic information

  • DOI https://doi.org/10.1007/b105263
  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-24401-1
  • Online ISBN 978-3-540-30540-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site