✦ LIBER ✦

A note on Hamiltonian split graphs

✍ Scribed by Rainer E Burkard; Peter L Hammer

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 230 KB
Volume: 28
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(80)90069-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on mixed graphs and directed spli

A note on mixed graphs and directed splitting off

✍ Enni, Steffen 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 329 KB 👁 2 views

We give counterexamples to two conjectures of Bill Jackson in Some remarks on arc-connectivity, vertex splitting, and orientation in graphs and digraphs (Journal of Graph Theory 12(3):429-436, 1988) concerning orientations of mixed graphs and splitting off in digraphs, and prove the first conjecture

A note on K4-closures in hamiltonian gra

A note on K4-closures in hamiltonian graph theory

✍ H.J. Broersma 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 310 KB

A note on Hamiltonian circuits

✍ V. Chvátal; P. Erdös 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 229 KB

On hamiltonian line graphs

✍ Lane Clark 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

On hamiltonian-connected graphs

✍ Ronald J. Gould; Xingxing Yu 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 735 KB

## Abstract One of the most fundamental results concerning paths in graphs is due to Ore: In a graph __G__, if deg __x__ + deg __y__ ≧ |__V__(__G__)| + 1 for all pairs of nonadjacent vertices __x, y__ ≅ __V__(__G__), then __G__ is hamiltonian‐connected. We generalize this result using set degrees.

On F-Hamiltonian graphs

✍ Zhenqi Yang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 390 KB

Suppose G is a graph, F is a l-factor of G. G is called F-Hamiltonian, if there exists a Hamiltonian cycle containing F in G. In this paper, two necessary and sufficient conditions for a general graph and a bipartite graph being F-Hamiltonian are provided, respectively.