✦ LIBER ✦

One-factors and k-factors

✍ Scribed by Akira Saito

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 204 KB
Volume: 91
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90241-9

No coin nor oath required. For personal study only.

✦ Synopsis

Let G be a graph with a l-factor F and of order at least four. Let k be a positive integer. If G -{x, y} has a k-factor for each xy E F

📜 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

k–Pyramidal One–Factorizations

✍ Giuseppe Mazzuoccolo; Gloria Rinaldi 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 130 KB

On the number of edge-disjoint one facto

On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs

✍ D.G. Hoffman; C.A. Rodger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 503 KB

In this paper we use Tutte's f-factor theorem and the method of amalgamations to find necessary and sufficient conditions for the existence of a k-factor in the complete multipartite graph K(p(1 ) ..... p(n)), conditions that are reminiscent of the Erd6s-Gallai conditions for the existence of simple

Perfect one-factorizations of K1332 and

Perfect one-factorizations of K1332 and K6860

✍ Midori Kobayashi; Kiyasu-Zen'iti 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 87 KB

k-factors in regular graphs

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

Connected [k, k + 1]-factors of graphs

✍ Mao-cheng Cai 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 541 KB

Let k be an odd integer /> 3, and G be a connected graph of odd order n with n/>4k -3, and minimum degree at least k. In this paper it is proved that if for each pair of nonadjacent vertices u, v in G max{dG(u), d~(v)} >~n/2, then G has an almost k--factor F + and a matching M such that F-and M are