Volume 75, Number 1, January 1999
: On Extremal Connectivity Properties of Unavoidable Matroids.
: The Number of Removable Edges in 3-Connected Graphs.
: On the Circumferences of Regular 2-Connected Graphs.
: Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5.
Valery A. Liskovets
: A Pattern of Asymptotic Vertex Valency Distributions in Planar Maps.
: A Short Proof of a Theorem Concerning Degree Sums and Connectivity on Hamiltonian Graphs.
Volume 75, Number 2, March 1999
: 9-Connected Claw-Free Graphs Are Hamilton-Connected.
: Finding Minimum Generators of Path Systems'.
: The Game Coloring Number of Planar Graphs.
, Takao Nishizeki
: Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings.