✦ LIBER ✦

A sufficient condition guaranteeing large cycles in graphs

✍ Scribed by Ladislav Stacho

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 263 KB
Volume: 169
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00110-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A sufficient condition for dominating cy

A sufficient condition for dominating cycles

✍ J.A Bondy; Genghua Fan 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 214 KB

A sufficient condition for all short cyc

A sufficient condition for all short cycles

✍ Stephan Brandt 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 279 KB

Generalizing a result of HSiggkvist et al. (1981), we prove that every non-bipartite graph of order n with more than (n -1)\*/4 + 1 edges contains cycles of every length between 3 and the length of a longest cycle.

Large cycles in graphs

✍ J.A. Bondy 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 485 KB

Abstrtct. The paper i~ concerned with the existence of cycles of specified length in finite undirected graphs and with the question of how this depends on the numbers of vertit.¢s and edges ~ ulje graph, In particular, a conjecture ofP. Erdiss that every graph of order n and size at least ](n 2-5n ¢

A sufficient condition for graphs with l

A sufficient condition for graphs with large neighborhood unions to be traceable

✍ Shijun Ren 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 246 KB

We prove that a 2-connected graph G of order p is traceable if (u, v, w, x are distinct vertices of G). In addition, we give a short proof of Lindquester's conjecture.

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 spectral condition for odd cycles in g

A spectral condition for odd cycles in graphs

✍ Vladimir Nikiforov 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 106 KB