dblp: Graphs and Combinatorics, Volume 8

H. L. Abbott, Geoffrey Exoo: On set systems not containing delta systems. 1-9

Ron Aharoni, Ron Holzman: Optimal fractional matchings and covers in infinite hypergraphs: Existence and duality. 11-22

Noga Alon, Edward R. Scheinerman: Generalized sum graphs. 23-29

Ralph J. Faudree, András Gyárfás, Jenö Lehel: Three-regular path pairable graphs. 45-52

Xiang-dong Hou: On theG-matrices with entries and eigenvalues inQ(i). 53-64

Bruce M. Landman, Ezra A. Brown, Frederick J. Portier: Partitions of bi-partite numbers into at mostj parts. 65-73

Ákos Seress: On Hajnal's triangle-free game. 75-79

Tamás Szönyi: Small complete arcs in André planes of square order. 81-89

Noga Alon, Zoltán Füredi: Spanning subgraphs of random graphs. 91-94

Noga Alon, Raphael Yuster: AlmostH-factors in dense graphs. 95-102

Mostafa Blidia, Konrad Engel: Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable. 103-108

J. A. Bondy, Stephen C. Locke: Triangle-free subgraphs of powers of cycles. 109-118

Bor-Liang Chen, Hung-Lin Fu: Total colorings of graphs of order 2n having maximum degree 2n-2. 119-123

Michel Deza, Monique Laurent, Svatopluk Poljak: The cut cone III: On the role of triangle facets. 125-142

Noboru Ito, Blessilda P. Raposa: Nearly triply regular Drad's ofRH type. 143-153

Van Bang Le, Erich Prisner: On inverse problems for the cycle graph operator. 155-164

Madeleine Paoli, G. W. Peck, William T. Trotter, Douglas B. West: Large regular graphs with no induced 2K₂. 165-197

Alexander Sidorenko: Asymptotic solution of the Turán problem for some hypergraphs. 199-201

Gerhard Behrendt: Automorphism groups of graphs with forbidden subgraphs. 203-206

Jürgen Bierbrauer: Designs with block-size 6 in projective planes of characteristic 2. 207-224

L. H. Clark, Roger C. Entringer, H. D. Shapiro: Smallest maximally nonhamiltonian graphs II. 225-231

Chris D. Godsil, Norbert Seifter: Graphs with polynomial growth are covering graphs. 233-241

Walter J. Gutjahr, Georg Ch. Pflug: The asymptotic distribution of leaf heights in binary trees. 243-251

Andreas Huck, Haruko Okamura: Counterexamples to a conjecture of mader about cycles through specified vertices inn-edge-connected graphs. 253-258

William Kocay: Reconstructing graphs as subsumed graphs of hypergraphs, and some self-complementary triple systems. 259-276

Jin Ho Kwak, Jaeun Lee: Counting some finite-fold coverings of a graph. 277-285

Roy Meshulam: On families of faces in discrete cubes. 287-289

Yohei Yamasaki: Shannon switching games without terminals III. 291-297

Frantisek Franek, Vojtech Rödl: Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs. 299-308

Peter Frankl, Vojtech Rödl: The Uniformity Lemma for hypergraphs. 309-312

Martin Kochol: A note on the arboricity of graphs. 313-315

Warwick de Launey: CirculantGH(p²; Z_p) exist for all primesp. 317-321

Hanno Lefmann, Vojtech Rödl, Robin Thomas: Monochromatic Vs multicolored paths. 323-332

Zbigniew Lonc: Packing, covering and decomposing of a complete uniform hypergraph into delta-systems. 333-341

Jaroslav Nesetril, Gert Sabidussi: Minimal asymmetric graphs of induced length 4. 343-359

K. B. Reid, Weizhen Gu: Peripheral and eccentric vertices in graphs. 361-375

E. Sampathkumar: A generalization of Menger's theorem for certain unicyclic graphs. 377-380

Hiroshi Suzuki: 2-Designs overGF(q). 381-389

Zoltán Füredi, Richard Stanley: Sets of vectors with many orthogonal paris. 391-394

Graphs and Combinatorics, Volume 8