✦ LIBER ✦

Maximal Sets of 2-Factors and Hamiltonian Cycles

✍ Scribed by D.G. Hoffman; C.A. Rodger; A. Rosa

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 279 KB
Volume: 57
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Essential independent sets and Hamiltoni

Essential independent sets and Hamiltonian cycles

✍ Chen, Guantao; Egawa, Yoshimi; Liu, Xin; Saito, Akira 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 355 KB

An independent set S of a graph G is said to be essential if S has a pair of vertices distance t w o apart in G. We prove that if every essential independent set S of order k 2 2 in a k-connected graph of order p satisfies max{deg u : u E S} I p, then G is hamiltonian. This generalizes the result of

Independent dominating sets and hamilton

Independent dominating sets and hamiltonian cycles

✍ Penny Haxell; Ben Seamone; Jacques Verstraete 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB

## Abstract A graph is uniquely hamiltonian if it contains exactly one hamiltonian cycle. In this note we prove that there are no __r__‐regular uniquely hamiltonian graphs when __r__ > 22. This improves upon earlier results of Thomassen. © 2006 Wiley Periodicals, Inc. J Graph Theory 54: 233–244, 20

Maximal sets of Hamilton cycles inKn,n

✍ Bryant, Darryn E.; El-Zanati, S.; Rodger, C. A. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 271 KB

In this article, we prove that there exists a maximal set of m Hamilton cycles in K n,n if and only if n/4 < m ≤ n/2.

Maximal sets of hamilton cycles in compl

Maximal sets of hamilton cycles in complete multipartite graphs

✍ Mike Daven; J. A. MacDougall; C. A. Rodger 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 2 views

## Abstract A set __S__ of edge‐disjoint hamilton cycles in a graph __G__ is said to be __maximal__ if the edges in the hamilton cycles in __S__ induce a subgraph __H__ of __G__ such that __G__ − __E__(__H__) contains no hamilton cycles. In this context, the spectrum __S__(__G__) of a graph __G__ i

On the number of hamiltonian cycles in a

On the number of hamiltonian cycles in a maximal planar graph

✍ S. L. Hakimi; E. F. Schmeichel; C. Thomassen 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB 👁 2 views

## Abstract We consider the problem of the minimum number of Hamiltonian cycles that could be present in a Hamiltonian maximal planar graph on __p__ vertices. In particular, we construct a __p__‐vertex maximal planar graph containing exactly four Hamiltonian cycles for every __p__ ≥ 12. We also pro

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