𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dominating cycles in regular 3-connected graphs

✍ Scribed by Bill Jackson; Hao Li; Yongjin Zhu

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
744 KB
Volume
102
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Jackson, B., H. Li and Y. Zhu, Dominating cycles in regular 3-connected graphs, Discrete Mathematics 102 (1992) 163-176.

Let G be a 3-connected, k-regular graph on at most 4k vertices. We show that, for k > 63, every longest cycle of G is a dominating cycle. We conjecture that G is in fact hamiltonian.

πŸ“œ SIMILAR VOLUMES

Hamilton cycles in regular 3-connected g
Hamilton cycles in regular 3-connected graphs
✍ Yongjin Zhu; Hao Li πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 993 KB

We show in this paper that for k Z-63, every 3-connected, k-regular simple graph on at most yk vertices is hamiltonian.

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

Dominating cycles in halin graphs
Dominating cycles in halin graphs
✍ MirosΕ‚awa SkowroΕ„ska; Maciej M. SysΕ‚o πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 676 KB

A cycle in a graph is dominating if every vertex lies at distance at most one from the cycle and a cycle is D-cycle if every edge is incident with a vertex of the cycle. In this paper, first we provide recursive formulae for finding a shortest dominating cycle in a Hahn graph; minor modifications ca