Volume 75, Number 1, January 1999
Zhaoyang Wu:
On Extremal Connectivity Properties of Unavoidable Matroids.
19-45
Jianji Su:
The Number of Removable Edges in 3-Connected Graphs.
74-87
Bing Wei:
On the Circumferences of Regular 2-Connected Graphs.
88-99
Carsten Thomassen:
Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5.
100-109
Valery A. Liskovets:
A Pattern of Asymptotic Vertex Valency Distributions in Planar Maps.
116-133
Bing Wei:
A Short Proof of a Theorem Concerning Degree Sums and Connectivity on Hamiltonian Graphs.
157-159
Volume 75, Number 2, March 1999
Stephan Brandt:
9-Connected Claw-Free Graphs Are Hamilton-Connected.
167-173
András Frank:
Finding Minimum Generators of Path Systems'.
237-244
Xuding Zhu:
The Game Coloring Number of Planar Graphs.
245-258
Xiao Zhou,
Takao Nishizeki:
Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings.
270-287
data released under the ODC-BY 1.0 license
