Maximal nonrevisiting paths in simple polytopes

DOI10.1016/S0012-365X(02)00525-3zbMath1027.52006OpenAlexW1979257172MaRDI QIDQ1869200

Fred B. Holt

Publication date: 9 April 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00525-3

zbMATH Keywords

pathspolytopesHirsch conjecturenonrevisiting conjecturestrong \(d\)-step conjecture

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (1)

One-point suspensions and wreath products of polytopes and spheres

This page was built for publication: Maximal nonrevisiting paths in simple polytopes