𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A cycle structure theorem for hamiltonian graphs

✍ Scribed by E.F Schmeichel; S.L Hakimi

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
485 KB
Volume
45
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A short proof of a theorem on Hamiltonia
A short proof of a theorem on Hamiltonian graphs
✍ Ainouche, A. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 219 KB πŸ‘ 2 views

In this note, w e give a short proof of a stronger version of the following theorem: Let G be a 2-connected graph of order n such that for any independent set {u, u , w}, then G is hamiltonian. 0 1996 John

A Matrix Method for Counting Hamiltonian
A Matrix Method for Counting Hamiltonian Cycles on Grid Graphs
✍ Y.H.Harris Kwong; D.G. Rogers πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 154 KB

A matrix method is used to determine the number of Hamiltonian cycles on \(P_{m} \times P_{n}, m=4\), 5. This provides an alternative to other approaches which had been used to solve the problem. The method and its more generalized version, transfer-matrix method, may give easier solutions to cases

A structure theorem for graphs with no c
A structure theorem for graphs with no cycle with a unique chord and its consequences
✍ Nicolas Trotignon; Kristina VuΕ‘koviΔ‡ πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 321 KB

## Abstract We give a structural description of the class π’ž of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that any connected graph in π’ž is either in some simple basic class or has a decomposition. Basic classes are chordless cycles, cliqu

Parity theorems for paths and cycles in
Parity theorems for paths and cycles in graphs
✍ J. A. Bondy; F. Y. Halberstam πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 294 KB πŸ‘ 1 views

We extend an elegant proof technique of A . G . Thomason, and deduce several parity theorems for paths and cycles in graphs. For example, a graph in which each vertex is of even degree has an even number of paths if and only if it is of even order, and a graph in which each vertex is of odd degree h