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.
Author(s): Jin Akiyama, Midori Kobayashi, Gisaku Nakamura (auth.), Hiro Ito, Mikio Kano, Naoki Katoh, Yushi Uno (eds.)
Series: Lecture Notes in Computer Science 4535
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2008
Language: English
Pages: 237
Tags: Computer Graphics; Discrete Mathematics in Computer Science; Algorithm Analysis and Problem Complexity; Data Structures; Convex and Discrete Geometry
Front Matter....Pages -
Dudeney Transformation of Normal Tiles....Pages 1-13
Chromatic Numbers of Specified Isohedral Tilings....Pages 14-24
Transforming Graphs with the Same Degree Sequence....Pages 25-32
The Forest Number of ( n , m )-Graphs....Pages 33-40
Computing Simple Paths on Points in Simple Polygons....Pages 41-55
Deflating the Pentagon....Pages 56-67
Enumeration of Polyominoes, Polyiamonds and Polyhexes for Isohedral Tilings with Rotational Symmetry....Pages 68-78
Solvable Trees....Pages 79-84
Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle....Pages 85-89
A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets....Pages 90-100
Fast Skew Partition Recognition....Pages 101-107
Some Results on Fractional Graph Theory....Pages 108-118
Seven Types of Random Spherical Triangle in S n and Their Probabilities....Pages 119-126
(3,2)-Track Layout of Bipartite Graph Subdivisions....Pages 127-131
Bartholdi Zeta Functions of Branched Coverings of Digraphs....Pages 132-143
On Super Edge-Magic Strength and Deficiency of Graphs....Pages 144-154
The Number of Flips Required to Obtain Non-crossing Convex Cycles....Pages 155-165
Divide and Conquer Method for k -Set Polygons....Pages 166-177
Coloring Axis-Parallel Rectangles....Pages 178-185
Domination in Cubic Graphs of Large Girth....Pages 186-190
Chvátal–Erdős Theorem: Old Theorem with New Aspects....Pages 191-200
Computer-Aided Creation of Impossible Objects and Impossible Motions....Pages 201-212
The Hamiltonian Number of Cubic Graphs....Pages 213-223
SUDOKU Colorings of the Hexagonal Bipyramid Fractal....Pages 224-235
Back Matter....Pages -
