Journal of Graph Theory Contents of Volume 15, 1991 Number 1, March 1991 On the Decomposition of K, into Complete m-Partite Graphs Q. Huang On the Largest Tree of Given Maximum Degree in a Connected Graph Y. Caro, |. Krasikov, and Y. Roditty An Upper Bound on the Ramsey Number A(K3,G) Depending Only on the Size of the Graph G A. F. Sidorenko On the Cycle-lsomorphism of Graphs X. Yu Long Dominating Cycles and Paths in Graphs with Large Neighborhood Unions H. J. Broersma and H. J. Veldman 29 On the Residue of a Graph O. Favaron, M. Mahéo, and J.-F. Saclé 39 On the Homogeneous Representation of Interval Graphs S. Olariu 65 Bounds for the Crossing Number of the V-Cube T. Madej 81 Improved Lower Bounds on k-Independence ¥. Caro and Z. Tuza 99 Inforriation for Contributors Number 2, June 1991 A Characterization of Domination Perfect Graphs LE. Zverovich and V.E. Zverovich On a Conjecture of Wang and Williams N.V.R. Mahadev and U.N. Peled 666 VOLUME CONTENTS Updating the Hamiltonian Proble—mA Survey R. J. Gould Local Extrema in Genus-Stratified Graphs J.L. Gross and R.G. Rieper Quasi-Random Tournaments F.R.K. Chung and R.L. Graham Bounding the Number of Embeddings of 5-Connected Projective-Planar Graphs S. Kitakubo The Structure and Maximum Number of Maximum Independent Sets in Trees J. Zito Seven Criteria for Integer Sequences Being Graphic G. Sierksma and H. Hoogeveen Information for Contributors Number 3, July 1991 The Threshold Weight of a Graph C. Wang and A.C. Williams Score Sequences of Oriented Graphs P. Avery Regular Factors in K,,3-Free Graphs S. A. Choudum and M. S. Paulraj On Path Lengths Modulo Three X. Deng and C.H. Papadimitriou [a,b]-Factorizations of Graphs M. Cai How to Deal with Unlabeled Random Graphs T. Luczak Tutte Polynomials for Trees S. Chaudhary and G. Gordon A Short Proof for a Generalization of Vizing’s Theorem G. Berge and J.C. Fournier Regular Factors in K,,,-Free Graphs Y¥. Egawa and K. Ota VOLUME CONTENTS 667 Number 4, September 1991 On an Upper Bound for the Harmonious Chromatic Number of a Graph 2. LU On the Structure of Unbreakable Graphs S. Olariu Characterization of a Class of Triangle-Free Graphs with a Certain Adjacency Property B. Alspach, C.C. Chen, and K. Heinrich Do 3n — 5 Edges Force a Subdivision of K;? A. E. Kézdy and P. J. McGuinness On the Orientable Genus of Graphs Embedded in the Klein Bottle N. Robertson and R. Thomas Cycles Containing 12 Vertices in 3-Connected Cubic Graphs S. Bau and D. Holton The Prism-Free Planar Graphs and Their Cycles Bases D. Hartvigsen and R. Mardon Neighborhood Unions and Hamilton Cycles B. Jackson Information for Contributors Number 5, November 1991 Smallest Regular Graphs with Prescribed Odd Girth G.-H. Zhang Multiplicativity. Part |. Variations, Multiplicative Graphs, and Digraphs H. Zhou Multiplicativity. Part Il. Nonmultiplicative Digraphs and Characterization of Oriented Graphs H. Zhou On Zero-Sum Delta-Systems and Multiple Copies of Hypergraphs Y. Caro 668 VOLUME CONTENTS Almost Resolvable P,-Decompositions of Complete Graphs M.-L. Yu 20-Relative Neighborhood Graphs Are Hamiltonian M.S. Chang, C.Y. Tang, and R.C.T. Lee Covering the Edges with Consecutive Sets G. Ding Number 6, December 1991 Vertex-Switching, isomorphism, and Pseudosimilarity M.N. Ellingham General Results on Tolerance Intersection Graphs M.S. Jacobson, F.R. McMorris, and E.R. Scheinerman Some Extremal Resu!ts in Cochromatic and Dichromatic Theory P. Erdos, J. Gimbel, and D. Kratsch Vertex-Transitive Graphs and Vertex-Transitive Maps L. Babai Upper Bounds for Harmonious Colorings C. McDiarmid and L. Xinhua Expected Numbers at Hitting Times C. McDiarmid Cycle Covers of Graphs with a Nowhere-Zero 4-Flow A. Raspaud Cycles Intersecting a Prescribed Vertex Set A Kaneko and A. Saito Volume Contents Information for Contributors