✦ LIBER ✦

The virtual k-factorability of graphs

✍ Scribed by Seiya Negami

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 340 KB
Volume: 11
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190110310

No coin nor oath required. For personal study only.

✦ Synopsis

It is shown that if a connected graph G admits a finite covering that has a k-factor, then there is a 1 -or 2-fold covering of G that has a k-factor and that such a covering can be given as a canonical bipartite graph associated with G.

will conflict with the first one in Czn-, but there is no trouble in C,,,_? since the two corresponding choices arise at different places. This suggests that a covering would simplify some obstruction to 1-factors.

📜 SIMILAR VOLUMES

K4−-factor in a graph

✍ Ken-ichi Kawarabayashi 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

## Abstract Let __G__ be a graph of order 4__k__ and let δ(__G__) denote the minimum degree of __G__. Let __F__ be a given connected graph. Suppose that |__V__(__G__)| is a multiple of |__V__(__F__)|. A spanning subgraph of __G__ is called an __F__‐factor if its components are all isomorphic to __F

On the structure of graphs with a unique

On the structure of graphs with a unique k-factor

✍ Petra Johann 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB 👁 2 views

The symmetric (2k, k)-graphs

✍ Matthias Kriesell 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB 👁 1 views

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

A 1-factorization of the line graphs of

A 1-factorization of the line graphs of complete graphs

✍ Brian Alspach 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 254 KB 👁 1 views

## Abstract A 1‐factorization is constructed for the line graph of the complete graph __K~n~__ when __n__ is congruent to 0 or 1 modulo 4.