Chords of longest circuits in 3-connected graphs

DOI10.1016/S0012-365X(02)00688-XzbMath1022.05039OpenAlexW2072578461MaRDI QIDQ1398264

Cun-Quan Zhang, Xue-Chao Li

Publication date: 29 July 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00688-x

zbMATH Keywords

projective planechordlongest circuit

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

Chords of longest circuits in locally planar graphs ⋮ A cycle of maximum order in a graph of high minimum degree has a chord ⋮ Chords in longest cycles ⋮ Removable edges and chords of longest cycles in 3-connected graphs ⋮ Every longest circuit of a 3‐connected,K_3,3‐minor free graph has a chord ⋮ Results and problems on chorded cycles: a survey

This page was built for publication: Chords of longest circuits in 3-connected graphs