Longest cycles and their chords

DOI10.1002/jgt.3190110409zbMath0649.05041OpenAlexW1970279538MaRDI QIDQ3794211

Cun-Quan Zhang

Publication date: 1987

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190110409

zbMATH Keywords

chordlongest cyclecubic planar graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Related Items (12)

Chords of longest circuits in locally planar graphs ⋮ A cycle of maximum order in a graph of high minimum degree has a chord ⋮ On longest cycles in essentially 4-connected planar graphs ⋮ On longest cycles in essentially 4-connected planar graphs ⋮ Chords in longest cycles ⋮ Removable edges and chords of longest cycles in 3-connected graphs ⋮ Longer cycles in essentially 4-connected planar graphs ⋮ On the Circumference of Essentially 4-connected Planar Graphs ⋮ Every longest circuit of a 3‐connected,K_3,3‐minor free graph has a chord ⋮ Unnamed Item ⋮ Circumference of essentially 4-connected planar triangulations ⋮ Results and problems on chorded cycles: a survey

Cites Work

• Two Isomorphs of the Four-Colour Problem

This page was built for publication: Longest cycles and their chords