default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 74
Volume 74, Numbers 1-2, 1989
- Alain Hertz, Dominique de Werra:
Foreword. 1-2 - Claude 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 - Shailesh 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
- Peter C. Fishburn, Neil J. A. Sloane:
The solution to Berlekamp's switching game. 263-290 - Jan Reiterman, Vojtech Rödl, Edita Sinajová:
Geometrical embeddings of graphs. 291-319 - Zoltán Füredi:
A projective plane is an outstanding 2-cover. 321-324 - Stanislav Jendrol':
A non-involutory selfduality. 325-326 - Jacques Wolfmann:
The weights of the dual code of the MELAS code over GF(3). 327-329 - Luigia Berardi:
Constructing 3-designs from spreads and lines. 331-332 - Mauro Biliotti:
On a construction of clay of bib designs from frobenius groups. 333-334 - Aart Blokhuis, Andries E. Brouwer, Henny A. Wilbrink:
Heden's bound on maximal partial spreads. 335-339 - Jenö Lehel, Fred R. McMorris, Debra D. Scott:
M-chain graphs of posets. 341-346
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-04-09 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
