𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Enumeration of Hamiltonian cycles in certain generalized Petersen graphs

✍ Scribed by Allen J Schwenk

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
497 KB
Volume
47
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On certain Hamiltonian cycles in planar
On certain Hamiltonian cycles in planar graphs
✍ BοΏ½hme, T.; Harant, J.; TkοΏ½?, M. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 162 KB πŸ‘ 2 views

The problem is considered under which conditions a 4-connected planar or projective planar graph has a Hamiltonian cycle containing certain prescribed edges and missing certain forbidden edges. The results are applied to obtain novel lower bounds on the number of distinct Hamiltonian cycles that mus

On the crossing numbers of certain gener
On the crossing numbers of certain generalized Petersen graphs
✍ Dan McQuillan; R. Bruce Richter πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 484 KB

In his paper on the crossing numbers of generalized Petersen graphs, Fiorini proves that P(8, 3) has crossing number 4 and claims at the end that P(10, 3) also has crossing number 4. In this article, we give a short proof of the first claim and show that the second claim is false. The techniques are

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