A Survey on Contractible Edges in Graphs of a Prescribed Vertex Connectivity Matthias Kriesell Pages: 1 - 30
Edge Maximal Non-Bipartite Graphs Without Odd Cycles of Prescribed Lengths Louis CaccettaRui-Zhong Jia Pages: 75 - 92
Enumerating Foldings and Unfoldings Between Polygons and Polytopes Erik D. DemaineMartin L. DemaineJoseph O'Rourke Pages: 93 - 104
The Diameters of Some Transition Graphs Constructed from Hamilton Cycles Mariko HagitaYoshiaki OdaKatsuhiro Ota Pages: 105 - 117
n-Tuple Coloring of Planar Graphs with Large Odd Girth William KlostermeyerCun Quan Zhang Pages: 119 - 132
Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph Matthias Kriesell Pages: 133 - 146
A Class of 2-Colorable Orthogonal Double Covers of Complete Graphs by Hamiltonian Paths Uwe Leck Pages: 155 - 167
A Fan Type Condition For Heavy Cycles in Weighted Graphs Shenggui ZhangHajo BroersmaLigong Wang Pages: 193 - 200
