✦ LIBER ✦

Embedding k-Regular Graphs in k + 1-Regular Graphs

✍ Scribed by Gardiner, A.

Book ID: 120095342
Publisher: Oxford University Press
Year: 1983
Tongue: English
Weight: 171 KB
Volume: s2-28
Category: Article
ISSN: 0024-6107
DOI: 10.1112/jlms/s2-28.3.393

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

k-factors in regular graphs

✍ Wai Chee Shiu; Gui Zhen Liu 📂 Article 📅 2008 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 171 KB

K-regular factors and semi-k-regular fac

K-regular factors and semi-k-regular factors in graphs

✍ Keiko Kotani 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 661 KB

k-regular factors and semi-k-regular fac

k-regular factors and semi-k-regular factors in bipartite graphs

✍ Keiko Kotani 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 418 KB

Regular factors in K1,3-free graphs

✍ S. A. Choudum; M. S. Paulraj 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB 👁 1 views

## Abstract We show that every connected __K__~1,3~‐free graph with minimum degree at least __2k__ contains a __k__‐factor and construct connected __K__~1,3~‐free graphs with minimum degree __k__ + __0__(√__k__) that have no __k__‐factor.

Regular factors in K1,n free graphs

✍ Yoshimi Egawa; Katsuhiro Ota 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 280 KB

## Abstract A graph is said to be __K__~1,__n__~‐free, if it contains no __K__~1,__n__~ as an induced subgraph. We prove that for __n__ ⩾ 3 and __r__ ⩾ __n__ −1, if __G__ is a __K__~1,__n__~‐free graph with minimum degree at least (__n__^2^/4(__n__ −1))__r__ + (3__n__ −6)/2 + (__n__ −1)/4__r__, the

Distance-regular graphs and (s, c, a, k)

Distance-regular graphs and (s, c, a, k)-graphs

✍ Paul Terwilliger 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 546 KB