𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Even cycles in graphs

✍ Scribed by Joseph G. Conlon

Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
888 KB
Volume
45
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Let G be a 3‐connected simple graph of minimum degree 4 on at least six vertices. The author proves the existence of an even cycle C in G such that G‐V(C) is connected and G‐E(C) is 2‐connected. The result is related to previous results of Jackson, and Thomassen and Toft. Thomassen and Toft proved that G contains an induced cycle C such that both G‐V(C) and G‐E(C) is 2‐connected. G does not in general contain an even cycle such that G‐V(C) is 2‐connected. © 2004 Wiley Periodicals, Inc. J Graph Theory 45: 163–223, 2004

📜 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 cycles with prescribed chords in pl
Even cycles with prescribed chords in planar cubic graphs
✍ Herbert Fleischner 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 254 KB

The following result is being proved. Theorem: Let e be an arbitrary line of the 2-connected, 3-regular, planar graph G such that e cioes not belong to any cut set of size 2. Then G contains an even cycle for which e is a chord.

Decomposing complete equipartite graphs
Decomposing complete equipartite graphs into short even cycles
✍ Benjamin R. Smith; Nicholas J. Cavenagh 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB

In this article we find necessary and sufficient conditions to decompose a complete equipartite graph into cycles of uniform length, in the case that the length is both even and short relative to the number of parts.

Bipartite graphs with cycles of all even
Bipartite graphs with cycles of all even lengths
✍ Edward Schmeichel; John Mitchem 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 428 KB 👁 1 views

## Abstract Let __G__ = (__X, Y, E__) be a bipartite graph with __X__ = __Y__ = __n__. Chvátal gave a condition on the vertex degrees of __X__ and __Y__ which implies that __G__ contains a Hamiltonian cycle. It is proved here that this condition also implies that __G__ contains cycles of every even

Cyclic even cycle systems of the complet
Cyclic even cycle systems of the complete graph
✍ Shung-Liang Wu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB 👁 1 views

## Abstract In this article, it is proved that for each even integer __m__⩾4 and each admissible value __n__ with __n__>2__m__, there exists a cyclic __m__‐cycle system of __K__~__n__~, which almost resolves the existence problem for cyclic __m__‐cycle systems of __K__~__n__~ with __m__ even. © 201