KyotoCGGT 2007:
Kyoto, Japan
Hiro Ito, Mikio Kano, Naoki Katoh, Yushi Uno (Eds.):
Computational Geometry and Graph Theory - International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers.
Lecture Notes in Computer Science 4535 Springer 2008, ISBN 978-3-540-89549-7 
- Jin Akiyama, Midori Kobayashi, Gisaku Nakamura:
Dudeney Transformation of Normal Tiles.
1-13
- Jin Akiyama, Chie Nara:
Chromatic Numbers of Specified Isohedral Tilings.
14-24
- Sergey Bereg, Hiro Ito:
Transforming Graphs with the Same Degree Sequence.
25-32
- Avapa Chantasartrassmee, Narong Punnim:
The Forest Number of (n, m)-Graphs.
33-40
- Ovidiu Daescu, Jun Luo:
Computing Simple Paths on Points in Simple Polygons.
41-55
- Erik D. Demaine, Martin L. Demaine, Thomas Fevens, Antonio Mesa, Michael A. Soss, Diane L. Souvaine, Perouz Taslakian, Godfried T. Toussaint:
Deflating the Pentagon.
56-67
- Hiroshi Fukuda, Nobuaki Mutoh, Gisaku Nakamura, Doris Schattschneider:
Enumeration of Polyominoes, Polyiamonds and Polyhexes for Isohedral Tilings with Rotational Symmetry.
68-78
- Severino V. Gervacio, Yvette F. Lim, Leonor A. Ruivivar:
Solvable Trees.
79-84
- Hasmawati, Hilda Assiyatun, Edy Tri Baskoro, A. N. M. Salman:
Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle.
85-89
- Kiyoshi Hosono, Masatsugu Urabe:
A Minimal Planar Point Set with Specified Disjoint Empty Convex Subsets.
90-100
- William S. Kennedy, Bruce Reed:
Fast Skew Partition Recognition.
101-107
- Guizhen Liu:
Some Results on Fractional Graph Theory.
108-118
- Yoichi Maeda:
Seven Types of Random Spherical Triangle in S n and Their Probabilities.
119-126
- Miki Miyauchi:
(3, 2)-Track Layout of Bipartite Graph Subdivisions.
127-131
- Hirobumi Mizuno, Iwao Sato:
Bartholdi Zeta Functions of Branched Coverings of Digraphs.
132-143
- A. A. G. Ngurah, Edy Tri Baskoro, Rinovia Simanjuntak, Saladin Uttunggadewa:
On Super Edge-Magic Strength and Deficiency of Graphs.
144-154
- Yoshiaki Oda, Mamoru Watanabe:
The Number of Flips Required to Obtain Non-crossing Convex Cycles.
155-165
- Wael El Oraiby, Dominique Schmitt:
Divide and Conquer Method for k -Set Polygons.
166-177
- János Pach, Gábor Tardos:
Coloring Axis-Parallel Rectangles.
178-185
- Dieter Rautenbach, Bruce Reed:
Domination in Cubic Graphs of Large Girth.
186-190
- Akira Saito:
Chvátal-Erdős Theorem: Old Theorem with New Aspects.
191-200
- Kokichi Sugihara:
Computer-Aided Creation of Impossible Objects and Impossible Motions.
201-212
- Sermsri Thaithae, Narong Punnim:
The Hamiltonian Number of Cubic Graphs.
213-223
- Hideki Tsuiki:
SUDOKU Colorings of the Hexagonal Bipyramid Fractal.
224-235
Last update Mon May 20 23:57:17 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
