On short cycles through prescribed vertices of a graph

DOI10.1016/J.DISC.2003.11.047zbMATH Open1048.05049OpenAlexW2107171806MaRDI QIDQ1883253FDOQ1883253

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

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

Recommendations

• On short paths through prescribed vertices of a graph
• Long cycles through specified vertices in a graph
• On short cycles through prescribed vertices of a polyhedral graph
• Cycles and paths through specified vertices in k-connected graphs
• Cycles through prescribed vertices with large degree sum

zbMATH Keywords

planar graphsshortest cycle

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)
• 4‐chrome Graphen und vollständige 4‐Graphen
• Menger's theorem

Cited In (10)

• Title not available (Why is that?)
• Long cycles through specified vertices in a graph
• On short paths through prescribed vertices of a graph
• A sufficient condition for all short cycles
• A look at cycles containing specified elements of a graph
• On short cycles through prescribed vertices of a polyhedral graph
• Local topological toughness and local factors
• On cycles through prescribed vertices in weakly separable graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

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

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