✦ LIBER ✦

Even cycles with prescribed chords in planar cubic graphs

✍ Scribed by Herbert Fleischner

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 254 KB
Volume: 44
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(83)90191-7

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Chords of Longest Cycles in Cubic Graphs

✍ Carsten Thomassen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 213 KB

We describe a general sufficient condition for a Hamiltonian graph to contain another Hamiltonian cycle. We apply it to prove that every longest cycle in a 3-connected cubic graph has a chord. We also verify special cases of an old conjecture of Sheehan on Hamiltonian cycles in 4-regular graphs and

Disjoint cycles with chords in graphs

✍ Ch. Sobhan Babu; Ajit A. Diwan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

## Abstract Let $n\_1,n\_2,\ldots,n\_k$ be integers, $n=\sum n\_i$, $n\_i\ge 3$, and let for each $1\le i\le k$, $H\_i$ be a cycle or a tree on $n\_i$ vertices. We prove that every graph __G__ of order at least __n__ with $\sigma\_2(G) \ge 2( n-k) -1$ contains __k__ vertex disjoint subgraphs $H\_1'

Cycles in Graphs with Prescribed Stabili

Cycles in Graphs with Prescribed Stability Number and Connectivity

✍ M. Kouider 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 113 KB

Long cycles in graphs with prescribed to

Long cycles in graphs with prescribed toughness and minimum degree

✍ Douglas Bauer; H.J. Broersma; J. van den Heuvel; H.J. Veldman 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 427 KB

A cycle C of a graph G is a D~-cycle if every component of G-V(C) has order less than 2. Using the notion of D~-cycles, a number of results are established concerning long cycles in graphs with prescribed toughness and minimum degree. Let G be a t-tough graph on n/> 3 vertices. If 6 > n/(t + 2) + 2-