𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonian weights and unique 3-edge-colorings of cubic graphs

✍ Scribed by Cun-Quan Zhang

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
402 KB
Volume
20
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A (1,2)‐eulerian weight w of a grph is hamiltonian if every faithful cover of w is a set of two Hamilton circuits. Let G be a 3‐connected cubic graph containing no subdivition of the Petersen graph. We prove that if G admits a hamiltonian weight then G is uniquely 3‐edge‐colorable. © 1996 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

Cubic graphs with three Hamiltonian cycl
Cubic graphs with three Hamiltonian cycles are not always uniquely edge colorable
✍ Andrew Thomason 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB 👁 1 views

## Abstract The generalized Petersen graph __P__(6__k__ + 3, 2) has exactly 3 Hamiltonian cycles for __k__ ≥ 0, but for __k__ ≥ 2 is not uniquely edge colorable. This disproves a conjecture of Greenwell and Kronk [1].

On the Number of 3-Edge Colorings of Cub
On the Number of 3-Edge Colorings of Cubic Graphs
✍ Christian Szegedy 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 127 KB

In this paper we present a short algebraic proof for a generalization of a formula of R. Penrose, Some applications of negative dimensional tensors, in: Combinatorial Mathematics and its Applications Welsh (ed.), Academic Press, 1971, pp. 221-244 on the number of 3-edge colorings of a plane cubic gr

Uniqueness of maximal dominating cycles
Uniqueness of maximal dominating cycles in 3-regular graphs and of hamiltonian cycles in 4-regular graphs
✍ Herbert Fleischner 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 461 KB 👁 2 views

## Abstract We construct 3‐regular (cubic) graphs __G__ that have a dominating cycle __C__ such that no other cycle __C__~1~ of __G__ satisfies __V(C)__ ⊆ __V__(__C__~1~). By a similar construction we obtain loopless 4‐regular graphs having precisely one hamiltonian cycle. The basis for these const