On short cycles through prescribed vertices of a graph

DOI10.1016/j.disc.2003.11.047zbMath1048.05049OpenAlexW2107171806MaRDI QIDQ1883253

Zsolt Tuza, Jochen Harant, Erhard Hexel, Frank Göring

Publication date: 1 October 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.047

zbMATH Keywords

planar graphsshortest cycle

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (3)

Local topological toughness and local factors ⋮ On short paths through prescribed vertices of a graph ⋮ A look at cycles containing specified elements of a graph

Cites Work

• Menger's Theorem
• 4‐chrome Graphen und vollständige 4‐Graphen
• Unnamed Item

This page was built for publication: On short cycles through prescribed vertices of a graph