✦ LIBER ✦

A binding number condition for graphs to be (a, b, k)-critical graphs

✍ Scribed by Sizhong Zhou; Jiashang Jiang; Lan Xu

Book ID: 113423303
Publisher: Elsevier
Year: 2012
Tongue: English
Weight: 344 KB
Volume: 18
Category: Article
ISSN: 1319-5166
DOI: 10.1016/j.ajmsc.2012.01.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Degree Conditions for Graphs to be Fract

Degree Conditions for Graphs to be Fractional (a,b,n)-Critical Graphs

✍ Jianxiang Li; Yinghong Ma 📂 Article 📅 2006 🏛 Academy of Mathematics and Systems Science, Chines 🌐 English ⚖ 166 KB

A neighborhood condition for graphs to b

A neighborhood condition for graphs to be maximally k-restricted edge connected

✍ Shiying Wang; Lei Zhang; Shangwei Lin 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 140 KB

A Sufficient Condition for Edge Chromati

A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2-Factor Conjecture

✍ Rong Luo; Yue Zhao 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 577 KB

A necessary and sufficient condition for

A necessary and sufficient condition for connected, locally k-connected k1,3-free graphs to be k-hamiltonian

✍ Zhou Huai-Lu 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 272 KB 👁 2 views

We prove the following conjecture of Broersma and Veldman: A connected, locally k-connected K,,-free graph is k-hamiltonian if and only if it is (k + 2)-connected ( k L 1). We use [ 11 for basic terminology and notation, and consider simple graphs only. Let G be a graph. By V(G) and E(G) we denote,

A binding number condition for graphs to be (a,&#xa0;b,&#xa0;k)-critical graphs

A binding number condition for graphs to be (a, b, k)-critical graphs