Chords of longest cycles in cubic graphs
From MaRDI portal
Publication:1386433
The author determines a condition which is sufficient to guarantee the existence of a second Hamilton cycle in a Hamiltonian graph. He uses this to prove that every longest cycle in a 3-connected cubic graph has a chord, and other results on the existence of a second Hamilton cycle.
Recommendations
Cites work
- A solution to a colouring problem of P. Erdős
- Colorings and orientations of graphs
- Cycles in graphs. (Workshop Cycles in Graphs held at Simon Fraser University, Burnaby, British Columbia, Canada, July 5 - August 20, 1982)
- scientific article; zbMATH DE number 4164908 (Why is no real title available?)
- scientific article; zbMATH DE number 49078 (Why is no real title available?)
- scientific article; zbMATH DE number 3512156 (Why is no real title available?)
- scientific article; zbMATH DE number 863469 (Why is no real title available?)
- On the number of Hamiltonian cycles in bipartite graphs
- Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
Cited in
(26)- Independent dominating sets and a second hamiltonian cycle in regular graphs
- Vertices of small degree in uniquely Hamiltonian graphs
- A cycle of maximum order in a graph of high minimum degree has a chord
- Long cycles in Hamiltonian graphs
- Removable edges and chords of longest cycles in 3-connected graphs
- From one to many rainbow Hamiltonian cycles
- Results and problems on chorded cycles: a survey
- The longest cycle problem is polynomial on interval graphs
- Uniquely Hamiltonian graphs of minimum degree 4
- On 2-factors with long cycles in cubic graphs
- Every longest circuit of a 3‐connected,K3,3‐minor free graph has a chord
- Traversing every edge in each direction once, but not at once: cubic (polyhedral) graphs
- Few Hamiltonian cycles in graphs with one or two vertex degrees
- Approximate and randomized algorithms for computing a second Hamiltonian cycle
- A conjecture generalizing Thomassen's chord conjecture in graph theory
- Chords in longest cycles
- Chords of longest cycles passing through a specified small set
- Another Hamiltonian cycle in bipartite Pfaffian graphs
- Longest cycles and longest chordless cycles in 2-connected graphs
- Chords of longest cycles in 3-connected graphs with some special circumferences
- What is on his mind?
- Chords in longest cycles in 3-connected graphs
- Chords of longest cycles in graphs with large circumferences
- On the length of longest chordless cycles
- Chords of longest circuits in locally planar graphs
- A degree constraint for uniquely Hamiltonian graphs
This page was built for publication: Chords of longest cycles in cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386433)
