𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Flows and parity subgraphs of graphs with large odd-edge-connectivity

✍ Scribed by Jinlong Shu; Cun-Quan Zhang; Taoye Zhang

Book ID
116630518
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
248 KB
Volume
102
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Subgraphs of large connectivity and chro
Subgraphs of large connectivity and chromatic number in graphs of large chromatic number
✍ N. Alon; D. Kleitman; C. Thomassen; M. Saks; P. Seymour πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 144 KB

For each pair k, rn of natural numbers there exists a natural number f(k, rn) such that every f ( k , m)-chromatic graph contains a k-connected subgraph of chromatic number at least rn.

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.