✦ LIBER ✦

Generalizations of Dirac’s theorem in Hamiltonian graph theory—A survey

✍ Scribed by Li, Hao

Book ID: 118750233
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 422 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.11.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A GENERALIZATION OF DIRACS THEOREM* ON T

A GENERALIZATION OF DIRACS THEOREM* ON TRIANGULATED GRAPHS

✍ Martin Charles Golumbic 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 250 KB

A generalization of dirac’s theorem

✍ Stephen C. Locke 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 520 KB

A generalization of Dirac’s theorem for

A generalization of Dirac’s theorem for K(1,3)-free graphs

✍ R. J. Faudree; R. J. Gould; M. S. Jacobson; L. M. Lesniak; T. E. Lindquester 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 824 KB

A generalization of Darboux theorem to H

A generalization of Darboux theorem to Hamiltonian field theory

✍ A. M. Astashov 📂 Article 📅 1984 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 497 KB

Neighborhood unions and a generalization

Neighborhood unions and a generalization of Dirac's theorem

✍ R.J. Faudree; R.J. Gould; M.S. Jacobson; L.M. Lesniak 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 818 KB

Dirac proved that if each vertex of a graph G of order n 23 has degree at least n/2, then the graph is Hamiltonian. This result will be generalized by showing that if the union of the neighborhoods of each pair of vertices of a 2connected graph G of sufficiently large order n has at least n/2 vertic

A Boolean proof of Richardson's theorem

A Boolean proof of Richardson's theorem on graph theory

✍ Yoshiko Takenaka 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 506 KB