Chords in longest cycles

DOI10.1016/j.jctb.2017.09.008zbMath1379.05032OpenAlexW2758503308WikidataQ56926447 ScholiaQ56926447MaRDI QIDQ684125

Carsten Thomassen

Publication date: 9 February 2018

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

Full work available at URL: https://backend.orbit.dtu.dk/ws/files/138545849/1_s2.0_S0095895617300965_main.pdf

zbMATH Keywords

chordsconnectivitylongest cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40) Vertex degrees (05C07)

Related Items (6)

Cycles with a chord in dense graphs ⋮ Cycles containing all the odd-degree vertices ⋮ A cycle of maximum order in a graph of high minimum degree has a chord ⋮ A parity theorem about trees with specified degrees ⋮ A PPA parity theorem about trees in a bipartite graph ⋮ Results and problems on chorded cycles: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• What is on his mind?
• Chords of longest circuits in locally planar graphs
• Cycles in graphs. (Workshop Cycles in Graphs held at Simon Fraser University, Burnaby, British Columbia, Canada, July 5 - August 20, 1982)
• A solution to a colouring problem of P. Erdős
• Independent dominating sets and a second hamiltonian cycle in regular graphs
• Chords of longest cycles in cubic graphs
• Chords of longest circuits in 3-connected graphs
• Removable edges and chords of longest cycles in 3-connected graphs
• Beautiful conjectures in graph theory
• On the Number of Hamiltonian Cycles in Bipartite Graphs
• Independent dominating sets and hamiltonian cycles
• Every longest circuit of a 3‐connected,K_3,3‐minor free graph has a chord
• Longest cycles and their chords
• Hamiltonian Cycles and Uniquely Edge Colourable Graphs
• Chords of longest circuits of graphs embedded in torus and Klein bottle

This page was built for publication: Chords in longest cycles