Discrete Mathematics, Volume 74

Volume 74, Numbers 1-2, 1989

• Alain Hertz, Dominique de Werra:
  Foreword. 1-2
  Electronic Edition (link) BibTeX
• C. Berge:
  Minimax relations for the partial q- colorings of a graph. 3-14
  Electronic Edition (link) BibTeX
• Kathie Cameron:
  A min-max relation for the partial q- colourings of a graph. Part II: Box perfection. 15-27
  Electronic Edition (link) BibTeX
• Pierre Duchet:
  On locally-perfect colorings. 29-32
  Electronic Edition (link) BibTeX
• Michael O. Albertson, Robert E. Jamison, Stephen T. Hedetniemi, Stephen C. Locke:
  The subchromatic number of a graph. 33-49
  Electronic Edition (link) BibTeX
• Alain Hertz, Dominique de Werra:
  Connected sequential colorings. 51-59
  Electronic Edition (link) BibTeX
• Anthony J. W. Hilton:
  Two conjectures on edge-colouring. 61-64
  Electronic Edition (link) BibTeX
• Béla Bollobás, H. R. Hind:
  A new upper bound for the list chromatic number. 65-75
  Electronic Edition (link) BibTeX
• Chính T. Hoàng, Nadimpalli V. R. Mahadev:
  A note on perfect orders. 77-84
  Electronic Edition (link) BibTeX
• François Jaeger:
  On the penrose number of cubic diagrams. 85-97
  Electronic Edition (link) BibTeX
• Robert E. Jamison:
  On the edge achromatic numbers of complete graphs. 99-115
  Electronic Edition (link) BibTeX
• Hal A. Kierstead:
  Applications of edge coloring of multigraphs to vertex coloring of graphs. 117-124
  Electronic Edition (link) BibTeX
• Marek Kubale:
  Interval vertex-coloring of a graph with forbidden colors. 125-136
  Electronic Edition (link) BibTeX
• Jean Mayer:
  Hadwiger's conjecture (k=6) : Neighbour configurations of 6-vertices in contraction- critical graphs. 137-148
  Electronic Edition (link) BibTeX
• Henry Meyniel:
  About colorings, stability and paths in directed graphs. 149-150
  Electronic Edition (link) BibTeX
• John Mitchem:
  On the harmonious chromatic number of a graph. 151-157
  Electronic Edition (link) BibTeX
• Stephan Olariu:
  Weak bipolarizable graphs. 159-171
  Electronic Edition (link) BibTeX
• Chính T. Hoàng, Bruce A. Reed:
  P4-comparability graphs. 173-200
  Electronic Edition (link) BibTeX
• Horst Sachs, Michael Stiebitz:
  On constructive methods in the theory of colour-critical graphs. 201-226
  Electronic Edition (link) BibTeX
• E. Sampathkumar, C. V. Venkatachalam:
  Chromatic partitions of a graph. 227-239
  Electronic Edition (link) BibTeX
• Maciej M. Syslo:
  Sequential coloring versus Welsh-Powell bound. 241-243
  Electronic Edition (link) BibTeX
• S. K. Tipnis, Leslie E. Trotter Jr.:
  A generalization of Robacker's theorem. 245-252
  Electronic Edition (link) BibTeX
• A. D. Petford, D. J. A. Welsh:
  A randomised 3-colouring algorithm. 253-261
  Electronic Edition (link) BibTeX

Volume 74, Number 3, 1989

• Peter C. Fishburn, N. J. A. Sloane:
  The solution to Berlekamp's switching game. 263-290
  Electronic Edition (link) BibTeX
• Jan Reiterman, Vojtech Rödl, Edita Sinajová:
  Geometrical embeddings of graphs. 291-319
  Electronic Edition (link) BibTeX
• Zoltán Füredi:
  A projective plane is an outstanding 2-cover. 321-324
  Electronic Edition (link) BibTeX
• Stanislav Jendrol:
  A non-involutory selfduality. 325-326
  Electronic Edition (link) BibTeX
• Jacques Wolfmann:
  The weights of the dual code of the MELAS code over GF(3). 327-329
  Electronic Edition (link) BibTeX
• Luigia Berardi:
  Constructing 3-designs from spreads and lines. 331-332
  Electronic Edition (link) BibTeX
• Mauro Biliotti:
  On a construction of clay of bib designs from frobenius groups. 333-334
  Electronic Edition (link) BibTeX
• Aart Blokhuis, Andries E. Brouwer, Henny A. Wilbrink:
  Heden's bound on maximal partial spreads. 335-339
  Electronic Edition (link) BibTeX
• Jenö Lehel, Fred R. McMorris, Debra D. Scott:
  M-chain graphs of posets. 341-346
  Electronic Edition (link) BibTeX