On short paths through prescribed vertices of a graph

DOI10.1016/j.disc.2005.11.040zbMath1115.05049OpenAlexW3210470417MaRDI QIDQ868361

Erhard Hexel

Publication date: 2 March 2007

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

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

zbMATH Keywords

cycleplanar graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• Cycles through specified vertices
• When m vertices in a k-connected graph cannot be walked round along a simple cycle
• On short cycles through prescribed vertices of a graph
• On paths and cycles through specified vertices
• 4‐chrome Graphen und vollständige 4‐Graphen

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