Polyhedral suspensions of arbitrary genus

DOI10.1007/s00373-010-0938-5zbMath1208.57003OpenAlexW2039092128MaRDI QIDQ604990

S. A. Lavrenchenko

Publication date: 12 November 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0938-5

zbMATH Keywords

Graph embeddingSimplicial complexesRegular polyhedraMaximum genusPlanarity

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Polyhedra and polytopes; regular figures, division of spaces (51M20) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Elementary problems in Euclidean geometries (51M04) Polyhedral manifolds (52B70) Suspensions (55P40)

Related Items (max. 100)

Irreducible triangulations of the once-punctured torus ⋮ Unnamed Item ⋮ Pairs of polyhedra sharing the same 1-skeleton in 3D and 4D spaces, without a single common face

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Realizing the chromatic numbers of triangulations of surfaces
• Graphs of given genus and arbitrarily large maximum genus
• A Linear Time Planarity Algorithm for 2-Complexes
• A combinatorial characterization of planar 2-complexes
• Approximating the Crossing Number of Toroidal Graphs
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM

This page was built for publication: Polyhedral suspensions of arbitrary genus