Journal of Combinatorial Theory, Series B, Volume 27

Volume 27, Number 1, August 1979

• Sami Beraha, Joseph Kahane:
  Is the four-color conjecture almost false? 1-12
  Electronic Edition (link) BibTeX
• Siddani Bhaskara Rao:
  Solution of the Hamiltonian problem for self-complementary graphs. 13-41
  Electronic Edition (link) BibTeX
• Paul A. Catlin:
  Brooks' graph-coloring theorem and the independence number. 42-48
  Electronic Edition (link) BibTeX
• Claude A. Christen, Stanley M. Selkow:
  Some perfect coloring properties of graphs. 49-59
  Electronic Edition (link) BibTeX
• T. A. McKee:
  A self-dual language for graph theory. 60-66
  Electronic Edition (link) BibTeX
• Edward Howorka:
  On metric properties of certain clique graphs. 67-74
  Electronic Edition (link) BibTeX
• E. J. Farrell:
  An introduction to matching polynomials. 75-86
  Electronic Edition (link) BibTeX
• Daniel I. A. Cohen:
  On the combinatorial antipodal-point lemmas. 87-91
  Electronic Edition (link) BibTeX
• Saul Stahl:
  Self-dual embeddings of Cayley graphs. 92-107
  Electronic Edition (link) BibTeX

Volume 27, Number 2, October 1979

• Edgar M. Palmer, Allen J. Schwenk:
  On the number of trees in a random forest. 109-121
  Electronic Edition (link) BibTeX
• M. J. Rigby, Roger B. Mallion:
  On the eigenvalues and eigenvectors of certain finite, vertex-weighted, bipartite graphs. 122-129
  Electronic Edition (link) BibTeX
• Kenneth Appel, Wolfgang Haken, Jean Mayer:
  Triangulation a v5 séparés dans le problème des quatre couleurs. 130-150
  Electronic Edition (link) BibTeX
• Jack E. Graver:
  The imbedding index of a graph. 151-159
  Electronic Edition (link) BibTeX
• C. C. Chen, H. H. Teh:
  Constructions of point-colour-symmetric graphs. 160-167
  Electronic Edition (link) BibTeX
• Robert E. Woodrow:
  There are four countable ultrahomogeneous graphs without triangles. 168-179
  Electronic Edition (link) BibTeX
• László Babai:
  Spectra of Cayley graphs. 180-189
  Electronic Edition (link) BibTeX
• Eva Nosal:
  Partition relations for denumerable ordinals. 190-197
  Electronic Edition (link) BibTeX
• Edward F. Schmeichel, Gary S. Bloom:
  Connectivity, genus, and the number of components in vertex-deleted subgraphs. 198-201
  Electronic Edition (link) BibTeX
• Thomas Andreae:
  Über eine eigenschaft lokalfiniter, unendlicher bäume. 202-215
  Electronic Edition (link) BibTeX
• Hien Q. Nguyen:
  Constructing the free erection of a geometry. 216-224
  Electronic Edition (link) BibTeX
• Jaroslav Nesetril, Vojtech Rödl:
  A short proof of the existence of highly chromatic hypergraphs without short cycles. 225-227
  Electronic Edition (link) BibTeX
• F. Stersoul:
  A characterization of the graphs in which the transversal number equals the matching number. 228-229
  Electronic Edition (link) BibTeX

Volume 27, Number 3, December 1979

• Maurice Pouzet:
  Note sur le problème de Ulam. 231-236
  Electronic Edition (link) BibTeX
• Guy Giraud:
  Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey. 237-253
  Electronic Edition (link) BibTeX
• A. G. Thomason:
  Critically partitionable graphs, I. 254-259
  Electronic Edition (link) BibTeX
• Laurence R. Matthews:
  Infinite subgraphs as matroid circuits. 260-273
  Electronic Edition (link) BibTeX
• Eiichi Bannai, Tatsuro Ito:
  On the spectra of certain distance-regular graphs. 274-293
  Electronic Edition (link) BibTeX
• Stephen B. Maurer:
  Vertex colorings without isolates. 294-319
  Electronic Edition (link) BibTeX
• Frank Bernhart, Paul C. Kainen:
  The book thickness of a graph. 320-331
  Electronic Edition (link) BibTeX
• Henry H. Glover, John Philip Huneke, Chin San Wang:
  103 Graphs that are irreducible for the projective plane. 332-370
  Electronic Edition (link) BibTeX