Wv paths on 3-polytopes
From MaRDI portal
Publication:5567009
Cited in
(8)- Nonrevisiting paths on surfaces
- Upper bounds for the diameter and height of graphs of convex polyhedra
- Superlinear subset partition graphs with dimension reduction, strong adjacency, and endpoint count
- \(W_ v\) cycles in plane graphs
- Connectivity and \(W_v\)-paths in polyhedral maps on surfaces
- A counterexample to the Hirsch conjecture
- A quasi-polynomial bound for the diameter\\of graphs of polyhedra
- Non-revisiting paths on surfaces with low genus
This page was built for publication: Wv paths on 3-polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5567009)