zbMATH — the first resource for mathematics

Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable. (English) Zbl 0495.05025

05C15 Coloring of graphs and hypergraphs
05C45 Eulerian and Hamiltonian graphs
Full Text: DOI
[1] Greenwell, Canad. Math. Bull. 16 pp 525– (1973) · Zbl 0275.05107
[2] Hamiltonian cycles and uniquely edge colorable graphs. Advances in Graph Theory. Ed. Academic, New York (1978) 259–268. · Zbl 0382.05039
[3] Hamiltonian circuits, Colloquio Internazionale sulle Teorie Combinatorie. Atti dei Convegni Lincei 17, Accad. Naz. Lincei, Roma I (1976) 193–199.
[4] Problem 2. In Proc. 5th British Comb. Conf. 1975. Utilitas Mathematica, Winnipeg (1976) 696.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.