✦ LIBER ✦

k-factors in regular graphs

✍ Scribed by Wai Chee Shiu; Gui Zhen Liu

Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2008
Tongue: English
Weight: 171 KB
Volume: 24
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-007-6555-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 regular graphs

✍ P. Katerinis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Katerinis, P., Regular factors in regular graphs, Discrete Mathematics 113 (1993) 269-274. Let G be a k-regular, (k -I)-edge-connected graph with an even number of vertices, and let m be an integer such that 1~ m s k -1. Then the graph obtained by removing any k -m edges of G, has an m-factor.

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

Regular factors in nearly regular graphs

✍ Jean-Claude Bermond; Michel Las Vergnas 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 232 KB

Regular factors in regular multipartite

Regular factors in regular multipartite graphs

✍ Arne Hoffmann 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 226 KB

We present sufficient conditions for a regular multipartite graph to have a regular factor. These conditions are best possible