𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Removable Edges and Chords of Longest Cycles in 3-Connected Graphs

✍ Scribed by Jichang Wu, Hajo Broersma, Haiyan Kang

Book ID
120788834
Publisher
Springer Japan
Year
2013
Tongue
English
Weight
201 KB
Volume
30
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Longest cycles in 3-connected graphs con
Longest cycles in 3-connected graphs contain three contractible edges
✍ Nathaniel Dean; Robert L. Hemminger; Katsuhiro Ota πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 221 KB πŸ‘ 1 views

We show that if G is a 3-connected graph of order at least seven, then every longest path between distinct vertices in G contains at least two contractible edges. An immediate corollary is that longest cycles in such graphs contain at least three contractible edges. We consider only finite undirect

Removable edges in 3-connected graphs
Removable edges in 3-connected graphs
✍ Derek A. Holton; Bill Jackson; Akira Saito; Nicholas C. Wormald πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 404 KB

## Abstract An edge __e__ of a 3‐connected graph __G__ is said to be __removable__ if __G__ ‐ __e__ is a subdivision of a 3‐connected graph. If __e__ is not removable, then __e__ is said to be __nonremovable.__ In this paper, we study the distribution of removable edges in 3‐connected graphs and pr

Chords of Longest Cycles in Cubic Graphs
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