Volume 101, Numbers 1-3, May 1992
- Kathie Cameron, Jack Edmonds:
Coflow polyhedra.
1-21
- Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau:
Extremal problems involving vertices and edges on odd cycles.
23-31
- Herbert Fleischner:
Spanning eularian subgraphs, the splitting Lemma, and Petersen's theorem.
33-37
- Herbert Fleischner, Michael Stiebitz:
A solution to a colouring problem of P. Erdös.
39-48
- András Frank:
On a theorem of Mader.
49-57
- Zoltán Füredi:
Indecomposable regular graphs and hypergraphs.
59-64
- Jerrold R. Griggs, Joan P. Hutchinson:
On the r-domination number of a graph.
65-72
- Harald Gropp:
Enumeration of regular graphs 100 years ago.
73-85
- Ervin Györi, Michael D. Plummer:
The Cartesian product of a k-extendable and an l-extendable graph is (k + l + 1)-extendable.
87-96
- Rudolf Halin:
Some finiteness results concerning separation in graphs.
97-106
- Denis Hanson:
A quick proof that K10 != P + P + P.
107-108
- Denis Hanson, Ping Wang, Leif K. Jørgensen:
On cages with given degree sets.
109-114
- Robert L. Hemminger, Xingxing Yu:
On 3-connected graphs with contractible edge covers of size k.
115-133
- Anthony J. W. Hilton, Zhao Cheng:
The chromatic index of a graph whose core has maximum degree two.
135-147
- François Jaeger:
A new invariant of plane bipartite cubic graphs.
149-164
- Hal A. Kierstead, William T. Trotter:
Colorful induced subgraphs.
165-169
- William Kocay:
An extension of the multi-path algorithm for finding hamilton cycles.
171-188
- Alexandr V. Kostochka:
List edge chromatic number of graphs with large girth.
189-201
- Daphne Der-Fen Liu:
T-colorings of graphs.
203-212
- Jean Mayer:
Conjecture de Hadwiger: k = 6. II - réductions de sommets de degré 6 dans les graphes 6- chromatiques contraction-critiques.
213-222
- Jaroslav Nesetril, Vojtech Rödl:
On Ramsey graphs without bipartite subgraphs.
223-229
- K. B. Reid, Weizhen Gu:
Plurality preference digraphs realized by trees, II: on realization numbers.
231-249
- Gert Sabidussi:
Binary invariants and orientations of graphs.
251-277
- Horst Sachs:
How to calculate the number of perfect matchings in finite sections of certain infinite plane graphs.
279-284
- Akira Saito:
Cycles of length 2 modulo 3 in graphs.
285-289
- Karen Seyffarth:
Hajós' conjecture and small cycle double covers of planar graphs.
291-306
- Michael Stiebitz:
On Hadwiger's number - a problem of the Nordhaus-Gaddum type.
307-317
- Henk Jan Veldman:
Cycles containing many vertices of large degree.
319-325
- Douglas R. Woodall:
An inequality for chromatic polynomials.
327-331
- Douglas R. Woodall:
A zero-free interval for chromatic polynomials.
333-341
- D. A. Youngs:
Gallai's problem on Dirac's construction.
343-350
- Jørgen Bang-Jensen, Bjarne Toft:
Unsolved problems presented at the Julius Petersen Graph Theory Conference.
351-360
Last update Wed May 22 17:28:09 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
