Volume 31,
Number 3,
December 1981
- Z. Baranyai, Gy. R. Szász:
Hamiltonian decomposition of lexicographic product.
253-261
Electronic Edition (link) BibTeX
- Jean-Luc Fouquet, J. L. Jolivet, M. Rivière:
Graphes cubiques d'indice trois, graphes cubiques isochromatiques, graphes cubiques d'indice quatre.
262-281
Electronic Edition (link) BibTeX
- Mark K. Goldberg:
Construction of class 2 graphs with maximum vertex degree 3.
282-291
Electronic Edition (link) BibTeX
- Anton Kotzig:
Decompositions of complete graphs into isomorphic cubes.
292-296
Electronic Edition (link) BibTeX
- Denis Naddef, William R. Pulleyblank:
Hamiltonicity and combinatorial polyhedra.
297-312
Electronic Edition (link) BibTeX
- Rick Giles, Leslie E. Trotter Jr.:
On stable set polyhedra for K1, 3-free graphs.
313-326
Electronic Edition (link) BibTeX
- Paul D. Seymour:
Even circuits in planar graphs.
327-338
Electronic Edition (link) BibTeX
- Ahmed Ainouche, Nicos Christofides:
Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs.
339-343
Electronic Edition (link) BibTeX
- D. L. Greenwell, D. G. Hoffman:
On a probabilistic method in graph theory.
344-347
Electronic Edition (link) BibTeX
- Fan R. K. Chung, Ronald L. Graham, James B. Shearer:
Universal caterpillars.
348-355
Electronic Edition (link) BibTeX
Copyright © Sun May 17 00:09:02 2009
by Michael Ley (ley@uni-trier.de)