✦ LIBER ✦

On critically hamiltonian graphs

✍ Scribed by Linda Lesniak-Foster

Publisher: Akadmiai Kiad
Year: 1977
Tongue: English
Weight: 216 KB
Volume: 29
Category: Article
ISSN: 1588-2632
DOI: 10.1007/bf01895844

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian properties of domination-cri

Hamiltonian properties of domination-critical graphs

✍ Ewa Wojcicka 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 445 KB

## Abstract In this paper we show that every connected, 3‐γ‐critical graph on more than 6 vertices has a Hamiltonian path.

On critically perfect graphs

✍ Wagler, Annegret 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 337 KB 👁 2 views

A perfect graph is critical, if the deletion of any edge results in an imperfect graph. We give examples of such graphs and prove some basic properties. We relate critically perfect graphs to well-known classes of perfect graphs, investigate the structure of the class of critically perfect graphs, a

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.

On randomly Hamiltonian graphs

✍ Carsten Thomassen 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 801 KB