๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algorithmic proofs of two relations between connectivity and the 1-factors of a graph

โœ Scribed by Harold N. Gabow

Book ID
107748295
Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
819 KB
Volume
26
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A characterisation of some 2-connected g
A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem
โœ Victor Bryant ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 196 KB

A simple characterisation of cycles and complete graphs highlights their significance in Brooks' theorem. It then shows that an algorithmic proof of that theorem. usually dealt with in two cases. is in fact covered by one of the cases. ## 1. Some 2-connected graphs Throughout this paper G = (V, E)

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.