Volume 58,
January 2001
- David C. Fisher, Suh-Ryung Kim, Chang Hoon Park, Yunsun Nam:
Two families of graphs that are not CCE-orientable.
- Lauren K. Williams:
On Exact n-Step Domination.
- David P. Day, Wayne Goddard, Michael A. Henning, Henda C. Swart:
Multipartite Ramsey Numbers.
- Toshinori Sakai:
Long Paths and Cycles Through Specified Vertices in k-Connected Graphs.
- Guantao Chen, Ralph J. Faudree, Warren E. Shreve:
Weak Clique-Covering Cycles and Paths.
- Gary Haggard, Thomas R. Mathies:
Using Thresholds to Compute Chromatic Polynomials.
- John Ginsburg, V. Linek:
A space-filling complete graph.
- Jenifer Corp, Jennifer McNulty:
On A Characterization of Balanced Matroids.
- Jason I. Brown, Richard J. Nowakowski:
Bounding the Roots of Independence Polynomials.
- Peter Che Bor Lam, Wai Chee Shiu, Feng Sun, Jianfang Wang, Guiying Yan:
Linear Vertex Arboricity, Independence Number and Clique Cover Number.
- Peter Horák, Edward Bertram, S. Mohammed:
Small 2-factors of Bipartite Graphs.
- Maria Kwasnik, Maciej Zwierzchowski:
Special Kinds of Domination Parameters of Edge-Deleted Graphs.
- Allen G. Fuller, Ronald J. Gould:
Path Spectra and Forbidden Families.
- Riste Skrekovski:
A note on choosability with separation for planar graphs.
- William Pensaert:
Minimum Average Broadcast Time in a Graph of Bounded Degree.
- Klaus Dohmen:
A New Perspective on the Union-Closed Sets Conjecture.
- Sanpei Kageyama, Tsutomu Shimata:
A combinatorial structure of affine (a1, ..., at)-resolvable (r, l)-designs.
- Jianping Li, Ruqun Shen, Feng Tian:
Cycles Containing Given Subsets in 1-Tough Graphs.
- Zhang Cheng-heng:
The Lucas Matrix of Order 2k Sequence {L(2k)n).
- Ignacio M. Pelayo, Camino Balbuena, J. Gómez:
On the connectivity of generalized p-cycles.
- Heather Gavlas:
A New Distance Measure between Graphs.
- Toru Kojima, Kiyoshi Ando:
Minimum length of cycles through specified vertices in graphs with wide-diameter at most d.
- Himmet Can, Lee Hawkins:
A Computer Program for Obtaining Subsystems.
- Lutz Volkmann:
Spanning multipartite tournaments of semicomplete multipartite digraphs.
- Antoaneta Klobucar:
K-dominating sets of P[2k+2]xP[n] and P[m]xP[n].
- Siaw-Lynn Ng, Peter R. Wild:
On k-arcs Covering a Line in Finite Projective Planes.
- Hong Wang:
On Quadrilaterals and Cycle Covers in a Bipartite Graph.
- Ian M. Wanless:
McLeish's construction for Latin squares without intercalates.
Copyright © Fri Dec 4 20:27:17 2009
by Michael Ley (ley@uni-trier.de)
