𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On 2-factors with given properties in claw-free graphs

✍ Scribed by Olga Fourtounelli; P. Katerinis

Publisher
Springer
Year
2009
Tongue
English
Weight
385 KB
Volume
78
Category
Article
ISSN
0001-9054

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Closure, 2-factors, and cycle coverings
Closure, 2-factors, and cycle coverings in claw-free graphs
✍ RyjοΏ½?ek, Zden?k; Saito, Akira; Schelp, R. H. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 239 KB πŸ‘ 3 views

In this article, we study cycle coverings and 2-factors of a claw-free graph and those of its closure, which has been defined by the first author (On a closure concept in claw-free graphs, J Combin Theory Ser B 70 (1997), 217-224). For a claw-free graph G and its closure cl(G), we prove: ( 1 (2) G

On stability of Hamilton-connectedness u
On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
✍ ZdenΔ›k RyjÑček; Petr VrΓ‘na πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 269 KB πŸ‘ 1 views

We show that, in a claw-free graph, Hamilton-connectedness is preserved under the operation of local completion performed at a vertex with 2-connected neighborhood. This result proves a conjecture by BollobΓ‘s et al.

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.