Volume 3, Number 1, December 1987

• 
  Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp, Ronald J. Gould, Michael S. Jacobson: Goodness of trees for generalized books. 1-6
• 
  Dragos Cvetkovic, Peter Rowlinson: Spectra of unicyclic graphs. 7-23
• 
  H. Enomoto, P. Frankl, N. Ito, K. Nomura: Codes with given distances. 25-38
• 
  Chris D. Godsil, Wilfried Imrich: Embedding graphs in Cayley graphs. 39-43
• 
  Frank Harary, Josef Lauri: The class reconstruction number of maximal planar graphs. 45-53
• 
  Richard P. Stanley: On the number of faces of centrally-symmetric simplicial polytopes. 55-66
• 
  Miroslaw Truszczynski, Zsolt Tuza: Linear upper bounds for local Ramsey numbers. 67-73
• 
  Zsolt Tuza: Inequalities for two set systems with prescribed intersections. 75-80
• 
  Mitsuo Yoshizawa: On schematic orthogonal arraysOA(q^t, k, q, t). 81-89
• 
  Noga Alon, Zoltán Füredi: On the kernel of intersecting families. 91-94
• 
  Eiichi Bannai, Tatsuro Ito: On distance-regular graphs with fixed valency. 95-109
• 
  Fan R. K. Chung, Peter Frankl: The maximum number of edges in a 3-graph not containing a given star. 111-126
• 
  Vasek Chvátal, Najiba Sbihi: Bull-free Berge graphs are perfect. 127-139
• 
  Dieter Jungnickel: On a theorem of Ganley. 141-143
• 
  Igor Kríz: Large independent sets in shift-invariant graphs - Solution of Bergelson's problem. 145-158
• 
  Haruko Okamura: Paths and edge-connectivity in graphs III. Six-terminalk paths. 159-189
• 
  Svatopluk Poljak, Zsolt Tuza: Maximum bipartite subgraphs of Kneser graphs. 191-199
• 
  Jin Akiyama, Mamoru Watanabe: Maximum induced forests of planar graphs. 201-202
• 
  Noga Alon, Jeff Kahn, Paul D. Seymour: Large induced degenerate subgraphs. 203-211
• 
  Janet Simpson Beissinger, Uri N. Peled: Enumeration of labelled threshold graphs and a theorem of frobenius involving eulerian polynomials. 213-219
• 
  Vasanti N. Bhat-Nayak, N. Ito, Anjana Wirmani-Prasad: Some New Hadamard matrices. 221-225
• 
  Yoshimi Egawa, Takashi Miyamoto, Sergio Ruiz: On randomlyn-cyclic digraphs. 227-238
• 
  Pierre Fraisse, Carsten Thomassen: Hamiltonian dicycles avoiding prescribed arcs in tournaments. 239-250
• 
  Zoltán Füredi: The maximum number of balancing sets. 251-254
• 
  John Gimbel, H. Joseph Straight: Some topics in cochromatic theory. 255-265
• 
  András Gyárfás, Jeno Lehel, Richard H. Schelp, Zsolt Tuza: Ramsey numbers for local colorings. 267-277
• 
  Katherine Heinrich, Pavol Hell: On the problem of bandsize. 279-284
• 
  Ortrud R. Oellermann: On thel-connectivity of a graph. 285-291
• 
  Paul Terwilliger, Michel Deza: The classification of finite connected hypermetric spaces. 293-298
• 
  Robert E. L. Aldred, Derek A. Holton: Cycles through five edges in 3-connected cubic graphs. 299-311
• 
  Neal Brand, W. Cary Huffman: Mendelsohn designs admitting the affine group. 313-324
• 
  Marie-Pierre Delest, Dominique Gouyou-Beauchamps, Bernard Vauquelin: Enumeration of parallelogram polyominoes with given bond and site perimeter. 325-339
• 
  Peter Frankl, Zoltán Füredi, János Pach: Bounding one-way differences. 341-347
• 
  Nora Hartsfield: The splitting number of the complete graph in the projective plane. 349-356
• 
  S. R. Jayaram: Line domination in graphs. 357-363
• 
  Ronald C. Mullin, Douglas R. Stinson: Pairwise balanced designs with block sizes 6t + 1. 365-377
• 
  András Recski: Elementary strong maps of graphic matroids. 379-382
• 
  J. M. S. Simões-Pereira: Underlying graph and total length of optimal realizations of variable distance matrices. 383-393

last updated on Sat May 18 06:08:54 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page