𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Keiko Kotani


Book ID
108316186
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
661 KB
Volume
186
Category
Article
ISSN
0012-365X

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
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 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.