Chords of longest circuits of graphs embedded in torus and Klein bottle

DOI10.1002/jgt.10091zbMath1019.05022OpenAlexW4240034587MaRDI QIDQ4808402

Cun-Quan Zhang, Xue-Chao Li

Publication date: 22 May 2003

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

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

zbMATH Keywords

chordsembedded graphslongest circuitcharge and discharge

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 of graphs embedded in torus and Klein bottle