✦ LIBER ✦

Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees

✍ Scribed by Ainouche, A.; Christofides, N.

Book ID: 120095560
Publisher: Oxford University Press
Year: 1985
Tongue: English
Weight: 154 KB
Volume: s2-32
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s2-32.3.385

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strong sufficient conditions for the exi

Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs

✍ Ahmed Ainouche; Nicos Christofides 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 225 KB

On the existence of a Hamiltonian circui

On the existence of a Hamiltonian circuit in a graph [II]

✍ Yoshiko Takenaka 📂 Article 📅 1972 🏛 Elsevier Science ⚖ 254 KB

Degree and stability number condition fo

Degree and stability number condition for the existence of connected factors in graphs

✍ Jiansheng Cai; Guizhen Liu 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 255 KB

On the existence of a Hamiltonian path i

On the existence of a Hamiltonian path in a graph

✍ Yoshiko Takenaka 📂 Article 📅 1968 🏛 Elsevier Science ⚖ 348 KB

On the Existence of Graphs with Prescrib

On the Existence of Graphs with Prescribed Degrees and Connectivity

✍ S. L. Hakimi 📂 Article 📅 1974 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 956 KB

A degree condition for the existence of

A degree condition for the existence of regular factors inK1,n-free graphs

✍ Ota, Katsuhiro; Tokuda, Taro 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 260 KB 👁 2 views

A graph is called K1,.-free if it contains no K l , n as an induced subgraph. Let n ( r 3), r be integers (if r is odd, r 2 n -1). We prove that every Kl,,-free connected graph G with rlV(G)I even has an r-factor if its minimum degree is at least This degree condition is sharp.