𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Characterization of Graphs without Even Factors

✍ Scribed by Xueliang Li; Zhao Zhang

Book ID
106047619
Publisher
Springer Japan
Year
2006
Tongue
English
Weight
95 KB
Volume
22
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Characterization of even directed graphs
Characterization of even directed graphs
✍ Paul Seymour; Carsten Thomassen πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 578 KB
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.

A characterization of graphs without lon
A characterization of graphs without long induced paths
✍ GΓ‘bor BacsΓ³; Zsolt Tuza πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 461 KB πŸ‘ 1 views

## Abstract In a connected graph define the k‐center as the set of vertices whose distance from any other vertex is at most __k.__ We say that a vertex set __S__ __d__‐dominates __G__ if for every vertex x there is a y ∈ __S__ whose distance from __x__ is at most __d__. Call a graph __P~t~__‐free

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