✦ LIBER ✦

A sufficient condition for dominating cycles

✍ Scribed by J.A Bondy; Genghua Fan

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 214 KB
Volume: 67
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90029-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two sufficient conditions for dominating

Two sufficient conditions for dominating cycles

✍ Mei Lu; Huiqing Liu; Feng Tian 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB

## Abstract A cycle __C__ of a graph __G__ is dominating if each component of $G\backslash C$ is edgeless. In the paper, we will give two sufficient conditions for each longest cycle of a 3‐connected graph to be a dominating cycle. © 2005 Wiley Periodicals, Inc. J Graph Theory

A sufficient condition for separability

✍ E.F. Cornelius Jr. 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 174 KB

A sufficient condition for invexity

✍ Morgan A Hanson; Norma G Rueda 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 214 KB

A note on distance-dominating cycles

✍ P. Fraisse 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 396 KB

Nous prouvons une conjecture due & Bondy et Fan. Un cycle C d'un graphe G est dit m-dominant si tout sommet de V(G -C) est a distance au plus m de C. Notre r&t&at est: si G est k-connexe, et si G n'a pas de cycle m-dominant, alors il existe un stable de cardinal k + 1, dont les sommets sont deux 3 d

A new sufficient condition for hamiltoni

A new sufficient condition for hamiltonian graphs

✍ Pierre Fraisse 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 1 views

One sufficient condition for hamiltonian

One sufficient condition for hamiltonian graphs

✍ Guantao Chen 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB 👁 1 views

## Abstract Let __G__ be a 2‐connected graph of order __n.__ We show that if for each pair of nonadjacent vertices __x__,__y__ ∈ __V(G)__, then __G__ is Hamiltonian.