Chords of longest cycles in cubic graphs

DOI10.1006/JCTB.1997.1776zbMath0905.05047OpenAlexW1990218616MaRDI QIDQ1386433

Carsten Thomassen

Publication date: 14 January 1999

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1997.1776

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (14)

A degree constraint for uniquely Hamiltonian graphs ⋮ Independent dominating sets and a second hamiltonian cycle in regular graphs ⋮ A cycle of maximum order in a graph of high minimum degree has a chord ⋮ Long cycles in Hamiltonian graphs ⋮ The longest cycle problem is polynomial on interval graphs ⋮ Chords in longest cycles ⋮ Removable edges and chords of longest cycles in 3-connected graphs ⋮ What is on his mind? ⋮ Every longest circuit of a 3‐connected,K_3,3‐minor free graph has a chord ⋮ Vertices of small degree in uniquely Hamiltonian graphs ⋮ Traversing every edge in each direction once, but not at once: Cubic (polyhedral) graphs ⋮ From one to many rainbow Hamiltonian cycles ⋮ Results and problems on chorded cycles: a survey ⋮ Uniquely Hamiltonian Graphs of Minimum Degree 4

Cites Work

• Cycles in graphs. (Workshop Cycles in Graphs held at Simon Fraser University, Burnaby, British Columbia, Canada, July 5 - August 20, 1982)
• Colorings and orientations of graphs
• A solution to a colouring problem of P. Erdős
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Chords of longest cycles in cubic graphs