𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonian Spider Intersection Graphs Are Cycle Extendable

✍ Scribed by Abueida, Atif; Busch, Arthur; Sritharan, R.

Book ID
121691270
Publisher
Society for Industrial and Applied Mathematics
Year
2013
Tongue
English
Weight
193 KB
Volume
27
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Hamiltonian cycles in n-extendable graph
Hamiltonian cycles in n-extendable graphs
✍ Ken-ichi Kawarabayashi; Katsuhiro Ota; Akira Saito πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 88 KB

## Abstract A graph __G__ of order at least 2__n__+2 is said to be __n__‐extendable if __G__ has a perfect matching and every set of __n__ independent edges extends to a perfect matching in __G__. We prove that every pair of nonadjacent vertices __x__ and __y__ in a connected __n__‐extendable graph

Cycle Extendability of Hamiltonian Inter
Cycle Extendability of Hamiltonian Interval Graphs
✍ Chen, Guantao; Faudree, Ralph J.; Gould, Ronald J.; Jacobson, Michael S. πŸ“‚ Article πŸ“… 2006 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 137 KB
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].