Removable edges and chords of longest cycles in 3-connected graphs

DOI10.1007/s00373-013-1296-xzbMath1291.05113OpenAlexW1998179088MaRDI QIDQ2014727

Jichang Wu, Haiyan Kang, Hajo J. Broersma

Publication date: 16 June 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1296-x

zbMATH Keywords

3-connected graphchordremovable edge

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (5)

A cycle of maximum order in a graph of high minimum degree has a chord ⋮ Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph ⋮ The longest cycle problem is polynomial on interval graphs ⋮ Chords in longest cycles ⋮ Contractible edges and removable edges in 3-connected graphs

Cites Work

• Unnamed Item
• Chords of longest circuits in locally planar graphs
• The number of removable edges in 3-connected graphs
• Chords of longest cycles in cubic graphs
• Chords of longest circuits in 3-connected graphs
• Removable edges in 3-connected graphs
• Every longest circuit of a 3‐connected,K_3,3‐minor free graph has a chord
• Longest cycles and their chords
• Chords of longest circuits of graphs embedded in torus and Klein bottle

This page was built for publication: Removable edges and chords of longest cycles in 3-connected graphs