𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upon the removal of the edges of a 1-factor from an even circuit in a 2-connected graph

✍ Scribed by Philip Sinclair

Book ID
108113432
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
206 KB
Volume
286
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The existence of a 2-factor in K1, n-fre
The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity
✍ R. E. L. Aldred; Yoshimi Egawa; Jun Fujisawa; Katsuhiro Ota; Akira Saito πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 130 KB πŸ‘ 1 views

In this article, we study the existence of a 2-factor in a K 1,nfree graph. Sumner [J London Math Soc 13 (1976), 351-359] proved that for n β‰₯ 4, an (n-1)-connected K 1,n -free graph of even order has a 1-factor.

On the number of (r,r+1)- factors in an
On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph
✍ A. J. W. Hilton πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 113 KB πŸ‘ 1 views

## Abstract For integers __d__β‰₯0, __s__β‰₯0, a (__d, d__+__s__)‐__graph__ is a graph in which the degrees of all the vertices lie in the set {__d, d__+1, …, __d__+__s__}. For an integer __r__β‰₯0, an (__r, r__+1)‐__factor__ of a graph __G__ is a spanning (__r, r__+1)‐subgraph of __G__. An (__r, r__+1)‐