𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On 4-connected graphs without even cycle decompositions

✍ Scribed by Romeo Rizzi

Book ID
108315592
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
90 KB
Volume
234
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Four-cycles in graphs without a given ev
Four-cycles in graphs without a given even cycle
✍ Daniela KΓΌhn; Deryk Osthus πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 104 KB

We prove that every bipartite C 2' -free graph G contains a C 4free subgraph H with e(H) ! e(G)=(' Γ€ 1). The factor 1=(' Γ€ 1) is best possible. This implies that ex(n; C 2' ) 2(' Γ€ 1)ex(n; fC 4 ; C 2' g), which settles a special case of a conjecture of Erdo ˝s and Simonovits.

Even cycle decompositions of complete gr
Even cycle decompositions of complete graphs minus a 1-factor
✍ Brian Alspach; Susan Marshall πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 873 KB

Some sufficient conditions are proven for the complete graph of even order with a 1-factor removed to be decomposable into even length cycles. 0 1994 John Wiley & Sons, Inc. ## 1. Introduction It is natural to ask when a complete graph admits a decomposition into cycles of some fixed length. Since

On the number of graphs without 4-cycles
On the number of graphs without 4-cycles
✍ Daniel J. Kleitman; Kenneth J. Winston πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 534 KB