Volume 16, Issue 2 | Graphs and Combinatorics

Search all Graphs and Combinatorics articles

Volume 16, Issue 2

June 2000

Filter by

Volume:

Sort by

Date published:

New to old Old to new

9 articles in this issue

How Tight Is the Bollobás-Komlós Conjecture?
Sarmad Abbasi
Pages: 129 - 137
On a Variation of Schur Numbers
Arie Bialostocki
Daniel Schaal
Pages: 139 - 147
The Generation of Maximal Triangle-Free Graphs
Stephan Brandt
Gunnar Brinkmann
Thomas Harmuth
Pages: 149 - 157
The Maximum Genus on a 3-Vertex-Connected Graph
Yuangqiu Huang
Pages: 159 - 164
Group Connectivity of 3-Edge-Connected Chordal Graphs
Hong-Jian Lai
Pages: 165 - 176
Longest Cycles in Almost Claw-Free Graphs
MingChu Li
Pages: 177 - 198
Matroids and Graphs with Few Non-Essential Elements
James Oxley
Haidong Wu
Pages: 199 - 229
The 2-Pebbling Property and a Conjecture of Graham's
Hunter S. Snevily
James A. Foster
Pages: 231 - 244
Edge Colorings of Embedded Graphs
Zhongde Yan
Yue Zhao
Pages: 245 - 256