Volume 196, Numbers 1-3, February 1999
: A variation on a theme of Sylvester - a smoother road to Göllnitz's (Big) theorem.
: Linkages in locally semicomplete digraphs and quasi-transitive digraphs.
Owen D. Byer
: Two path extremal graphs and an application to a Ramsey-type problem.
: Erdös-Ko-Rado-type results over Jq(n, d), Hq(n, d) and their designs.
: Distance graphs and the T-coloring problem.
: A generalization of fan's condition and forbidden subgraph conditions for hamiltonicity.
: Triangles with restricted degrees of their boundary vertices in plane triangulations.
: On the degrees of irreducible factors of polynomials over a finite field.
B. S. Panda
: The forbidden subgraph characterization of directed vertex graphs.