Table Of Content

Journal of Graph Theory Contents of Volume 32, 1999 Number 1, September 1999 Indecomposable r-Graphs and Some Other Counterexamples R. Rizzi On k-Ordered Hamiltonian Graphs H. A. Kierstead, G. N. Sarkozy, and S. M. Selkow Decomposing Large Graphs with Small Graphs of High Density R. Yuster Computation of the Folkman Number Fe(3, 3; 5) K. Piwakowski, S. PR. Radziszowski, and S. Urbanski Degree Sums and Graphs that are not Covered by Two Cycles A. Saito The Circular Chromatic Number of the Mycielskian of Gd? L. Huang and G. J. Chang Berge Graphs with Chordless Cycles of Bounded Length I. Rusu On Certain Hamiltonian Cycles in Planar Graphs T. Bohme, J. Harant, and M. Tkaé Acyclic Improper Colorings of Graphs P. Boiron, E. Sopena, and L. Vignal Information for Contributors Number 2, October 1999 Closure, 2-Factors, and Cycle Coverings in Claw-Free Graphs Z. Ryjacek, A. Saito, and R. H. Schelp On a Conjecture of Thomassen and Toft M. Kreisell Hamilton Cycles, Avoiding Prescribed Arcs, in Close-to-Regular Tournaments A. Yeo JOURNAL OF GRAPH THEORY Diregular c-Partite Tournaments are Vertex-Pancyclic When c>S A. Yeo A Sharp Edge Bound on the Interval Number of a Graph J. Balogh and A. Pluhar Cyclicity of Graphs R. Hammack Simultaneous Intersection Representation of Pairs of Graphs P. J. Tanenbaum A Universal Planar Graph under the Minor Relation R. Diestel and D. Kuhn Zero-Sum Delta-Systems and Multiple Copies of Graphs Y. Caro and C. Provstgaard Number 3, November 1999 An Infinite Family of Biprimitive Semisymmetric Graphs S.-F. Du and D. Marusic SGDs with Doubly Transitive Automorphism Group P. J. Cameron A Note on Possible Extensions of Negami’s Conjecture P. Hlineny k-Independence and the k-Residue of a Graph F. Jelen Graphs of Degree 4 are 5-Edge-Choosable M. Juvan, B. Mohar and R. Skrekovski Exploring an Unknown Graph X. Deng and C. H. Papadimitriou Distinguishing Two Graph-Encoded Manifolds of Lins J. FP Hudson k-Bounded Classes of Dominant-Independent Perfect Graphs I. E. Zverovich VOLUME CONTENTS Number 4, December 1999 Improved Bounds for the Chromatic Index of Graphs and Multigraphs S. L. Hakimi and E. F. Schmeichel Dirac’s Map-Color Theorem for Choosability T. Bohme, B. Mohar, and M. Stiebitz Intersection Representation of Digraphs in Trees with Few Leaves l.-J. Lin, M. K. Sen, and D. B. West Coloring of Trees with Minimum Sum of Colors T. Jiang and D. B. West Perfectly Contractile Diamond-Free Graphs |. Rusu A Lower Bound for Partial List Colorings G. G. Chappell On Critically Perfect Graphs A. Wagler More than One Tough Chordal Planar Graphs are Hamiltonian T. Bohme, J. Harant, and M. Tkacé Author Index Volume Contents Information for Contributors