𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cycle Extendability of Hamiltonian Interval Graphs

✍ Scribed by Chen, Guantao; Faudree, Ralph J.; Gould, Ronald J.; Jacobson, Michael S.

Book ID
118198907
Publisher
Society for Industrial and Applied Mathematics
Year
2006
Tongue
English
Weight
137 KB
Volume
20
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 in graphs and digrap
Cycle extendability in graphs and digraphs
✍ LeRoy B. Beasley; David E. Brown πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 201 KB

In 1990, Hendry conjectured that all chordal Hamiltonian graphs are cycle extendable, that is, the vertices of each non-Hamiltonian cycle are contained in a cycle of length one greater. Let A be a symmetric (0,1)-matrix with zero main diagonal such that A is the adjacency matrix of a chordal Hamilto

Cycle spectra of Hamiltonian graphs
Cycle spectra of Hamiltonian graphs
✍ Kevin G. Milans; Florian Pfender; Dieter Rautenbach; Friedrich Regen; Douglas B. πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 152 KB
Hamiltonian Cycles in Graphs
Hamiltonian Cycles in Graphs
✍ ZHENHONG LIU; YONGJIN ZHU; FENG TIAN πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 390 KB