Skip to main content
Springer Nature Link
Account

Computational Geometry and Graph Theory

International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers

  • Conference proceedings
  • © 2008

Overview

Editors:
  1. Hiro Ito

    1. School of Informatics, Kyoto University, Yosida-Honmati, Kyoto, Japan

  2. Mikio Kano

    1. Ibaraki University, Nakanarusawa, Hitachi, Ibaraki, Japan

  3. Naoki Katoh

    1. Department of Architecture and Architectural Engineering, Kyoto University, Nishikyo-ku, Kyoto, Japan

  4. Yushi Uno

    1. Graduate School of Science, Department of Mathematics and Information Sciences, Osaka Prefecture University, Sakai, Japan

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

Part of the book sub series: Image Processing, Computer Vision, Pattern Recognition, and Graphics (LNIP)

Included in the following conference series:

Conference proceedings info: KyotoCGGT 2007.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This book constitutes the thoroughly refereed post-conference proceedings of the Kyoto Conference on Computational Geometry and Graph Theory, KyotoCGGT 2007, held in Kyoto, Japan, in June 2007, in honor of Jin Akiyama and Vašek Chvátal, on the occasion of their 60th birthdays. The 19 revised full papers, presented together with 5 invited papers, were carefully selected during two rounds of reviewing and improvement from more than 60 talks at the conference. All aspects of Computational Geometry and Graph Theory are covered, including tilings, polygons, impossible objects, coloring of graphs, Hamilton cycles, and factors of graphs.

Similar content being viewed by others

Keywords

Table of contents (24 papers)

  1. Front Matter

    Download chapter PDF

  2. Dudeney Transformation of Normal Tiles

    • Jin Akiyama, Midori Kobayashi, Gisaku Nakamura
    Pages 1-13

  3. Chromatic Numbers of Specified Isohedral Tilings

    • Jin Akiyama, Chie Nara
    Pages 14-24

  4. Transforming Graphs with the Same Degree Sequence

    • Sergey Bereg, Hiro Ito
    Pages 25-32

  5. The Forest Number of (n,m)-Graphs

    • Avapa Chantasartrassmee, Narong Punnim
    Pages 33-40

  6. Computing Simple Paths on Points in Simple Polygons

    • Ovidiu Daescu, Jun Luo
    Pages 41-55

  7. Deflating the Pentagon

    • Erik D. Demaine, Martin L. Demaine, Thomas Fevens, Antonio Mesa, Michael Soss, Diane L. Souvaine et al.
    Pages 56-67

  8. Enumeration of Polyominoes, Polyiamonds and Polyhexes for Isohedral Tilings with Rotational Symmetry

    • Hiroshi Fukuda, Nobuaki Mutoh, Gisaku Nakamura, Doris Schattschneider
    Pages 68-78

  9. Solvable Trees

    • Severino V. Gervacio, Yvette F. Lim, Leonor A. Ruivivar
    Pages 79-84

  10. Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle

    • Hasmawati, H. Assiyatun, E. T. Baskoro, A. N. M. Salman
    Pages 85-89

  11. A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets

    • Kiyoshi Hosono, Masatsugu Urabe
    Pages 90-100

  12. Fast Skew Partition Recognition

    • William S. Kennedy, Bruce Reed
    Pages 101-107

  13. Some Results on Fractional Graph Theory

    • Guizhen Liu
    Pages 108-118

  14. Seven Types of Random Spherical Triangle in S n and Their Probabilities

    • Yoichi Maeda
    Pages 119-126

  15. (3,2)-Track Layout of Bipartite Graph Subdivisions

    • Miki Miyauchi
    Pages 127-131

  16. Bartholdi Zeta Functions of Branched Coverings of Digraphs

    • Hirobumi Mizuno, Iwao Sato
    Pages 132-143

  17. On Super Edge-Magic Strength and Deficiency of Graphs

    • A. A. G. Ngurah, E. T. Baskoro, R. Simanjuntak, S. Uttunggadewa
    Pages 144-154

  18. The Number of Flips Required to Obtain Non-crossing Convex Cycles

    • Yoshiaki Oda, Mamoru Watanabe
    Pages 155-165

  19. Divide and Conquer Method for k-Set Polygons

    • Wael El Oraiby, Dominique Schmitt
    Pages 166-177

  20. Coloring Axis-Parallel Rectangles

    • János Pach, Gábor Tardos
    Pages 178-185
Back to top

Editors and Affiliations

  • School of Informatics, Kyoto University, Yosida-Honmati, Kyoto, Japan

    Hiro Ito

  • Ibaraki University, Nakanarusawa, Hitachi, Ibaraki, Japan

    Mikio Kano

  • Department of Architecture and Architectural Engineering, Kyoto University, Nishikyo-ku, Kyoto, Japan

    Naoki Katoh

  • Graduate School of Science, Department of Mathematics and Information Sciences, Osaka Prefecture University, Sakai, Japan

    Yushi Uno

Accessibility Information

Accessibility information for this book is coming soon. We're working to make it available as quickly as possible. Thank you for your patience.

Bibliographic Information

Publish with us

Policies and ethics

Back to top