✦ LIBER ✦

New sufficient conditions for cycles in graphs

✍ Scribed by Geng-Hua Fan

Book ID: 107884212
Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 333 KB
Volume: 37
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(84)90054-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New sufficient condition for Hamiltonian

New sufficient condition for Hamiltonian graphs

✍ Kewen Zhao; Hong-Jian Lai; Yehong Shao 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 183 KB

A sufficient condition guaranteeing larg

A sufficient condition guaranteeing large cycles in graphs

✍ Ladislav Stacho 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 263 KB

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

A new sufficient condition for Hamiltoni

A new sufficient condition for Hamiltonian graphs

✍ Ronald J. Gould; Kewen Zhao 📂 Article 📅 2006 🏛 Springer Netherlands 🌐 English ⚖ 180 KB

Two new sufficient conditions for Hamilt

Two new sufficient conditions for Hamilton-connected graphs

✍ Zhengsheng Wu 📂 Article 📅 1995 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 415 KB

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