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

DOI10.1007/S00373-013-1296-XMaRDI QIDQ2014727zbMATH OpenOpenAlexFDO

Authors Jichang Wu, Haiyan Kang, Hajo 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

chord3-connected graphremovable edge

Mathematics Subject Classification ID

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

Recommendations

• Longest cycles and their chords
• Chords of longest circuits in 3-connected graphs
• Every longest circuit of a 3‐connected,K_3,3‐minor free graph has a chord
• Removable edges in the longest cycles of a 4-connected graph
• Contractible edges and longest cycles in 3-connected graphs

Cites work

• scientific article; zbMATH DE number 863469 (Why is no real title available?)
• Chords of longest circuits in 3-connected graphs
• Chords of longest circuits in locally planar graphs
• Chords of longest circuits of graphs embedded in torus and Klein bottle
• Chords of longest cycles in cubic graphs
• Every longest circuit of a 3‐connected,K_3,3‐minor free graph has a chord
• Longest cycles and their chords
• Removable edges in 3-connected graphs
• The number of removable edges in 3-connected graphs

Cited in

(8)

• Chords in longest cycles
• The longest cycle problem is polynomial on interval graphs
• Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph
• Removable edges on a Hamilton cycle or outside a cycle in a 4-connected graph
• Contractible edges and removable edges in 3-connected graphs
• A cycle of maximum order in a graph of high minimum degree has a chord
• Longest cycles and their chords
• scientific article; zbMATH DE number 1918634 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014727)