Embedding a pair of graphs in a surface, and the width of 4-dimensional prismatoids
From MaRDI portal
Publication:411413
DOI10.1007/s00454-011-9361-9zbMath1238.05078arXiv1104.2630OpenAlexW3104455254MaRDI QIDQ411413
Hugh Thomas, Tamon Stephen, Francisco Santos
Publication date: 4 April 2012
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.2630
Distance in graphs (05C12) Polytopes and polyhedra (52B99) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Recent progress on the combinatorial diameter of polytopes and simplicial complexes, A counterexample to the Hirsch conjecture, On the circuit diameter conjecture, The width of five-dimensional prismatoids
Cites Work