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