Graph theory and combinatorics
R. J. Wilson [editor].
London : Pitman Advanced Publishing Program, ©1979.
148 págs. : ilustraciones ; 25 cm.
Serie: Research notes in mathematics ; 34
ISBN: 0273084356
"Proceedings of a one-day conference in Combinatorics and Graph Theory held at The Open University, England, on 12 May 1978."—Preface.
Contiene 1 h. de errata.
Incluye referencias bibliográficas.
Reseña: MathSciNet, 81h:05004
Contenido
- L. D. Andersen and A. J. W. Hilton, Generalized Latin rectangles
- J.-C. Bermond, Graceful graphs, radio antennae and French windmills
- P. J. Cameron, Multiple transitivity in graphs
- M. Gordon and J. A. Torkington, Improvements in the random walk model of polymer chains
- Michel Las Vergnas, On Eulerian partitions of graphs
- Colin McDiarmid, Colouring random graphs badly
- C. St. J. A. Nash-Williams, Acyclic detachments of graphs
- F. Piper, Unitary block designs
- A. T. White, Strongly symmetric maps
- C. C. Wright, Arcs and cars: an approach to road traffic management based on graph theory
- M. Gordon and J. W. Kennedy, Some problems on lattice graphs.