Skip to main content
  • Conference proceedings
  • © 2005

Combinatorial Geometry and Graph Theory

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

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): IJCCGGT: Indonesia-Japan Joint Conference on Combinatorial Geometry and Graph Theory

Conference proceedings info: IJCCGGT 2003.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (23 papers)

  1. Front Matter

  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. Antimagic Valuations for the Special Class of Plane Graphs

    • Martin Bača, Edy Tri Baskoro, Mirka Miller
    Pages 58-64
  6. Some Conditions for the Existence of (d,k)-Digraphs

    • Yus Mochamad Cholily, Edy Tri Baskoro, Saladin Uttunggadewa
    Pages 87-93
  7. On a Triangle with the Maximum Area in a Planar Point Set

    • Kiyoshi Hosono, Ferran Hurtado, Masatsugu Urabe, Jorge Urrutia
    Pages 102-107
  8. A Balanced Interval of Two Sets of Points on a Line

    • Atsushi Kaneko, M. Kano
    Pages 108-112
  9. Spanning Trees of Multicoloured Point Sets with Few Intersections

    • J. Leaños, C. Merino, G. Salazar, J. Urrutia
    Pages 113-122
  10. Disjoint Edges in Topological Graphs

    • János Pach, Géza Tóth
    Pages 133-140
  11. The Decycling Number of Cubic Graphs

    • Narong Punnim
    Pages 141-145
  12. Equal Area Polygons in Convex Bodies

    • T. Sakai, C. Nara, J. Urrutia
    Pages 146-158
  13. Maximum Order of Planar Digraphs

    • Rinovia Simanjuntak, Mirka Miller
    Pages 159-168
  14. (a,d)-Edge-Antimagic Total Labelings of Caterpillars

    • K. A. Sugeng, M. Miller, Slamin, M. Bača
    Pages 169-180

Other Volumes

  1. Combinatorial Geometry and Graph Theory

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
  • algorithm analysis and problem complexity
  • data structures

Editors and Affiliations

  • Research Institute of Education, Tokai University, Tokio, Japan

    Jin Akiyama

  • Department of Mathematics, Institut Teknologi Bandung (ITB), Indonesia

    Edy Tri Baskoro

  • Ibaraki University, Nakanarusawa, Hitachi, Ibaraki, Japan

    Mikio Kano

Bibliographic Information

  • Book Title: Combinatorial Geometry and Graph Theory

  • Book Subtitle: Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers

  • Editors: Jin Akiyama, Edy Tri Baskoro, Mikio Kano

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/b105263

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer-Verlag Berlin Heidelberg 2005

  • Softcover ISBN: 978-3-540-24401-1Published: 31 January 2005

  • eBook ISBN: 978-3-540-30540-8Published: 18 January 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: VIII, 227

  • Topics: Computer Graphics, Discrete Mathematics in Computer Science, Algorithms, Data Science

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions