Polytopality and Cartesian products of graphs

DOI10.1007/s11856-012-0049-5zbMath1257.05142arXiv1009.1499OpenAlexW3098790546MaRDI QIDQ1932654

Julian Pfeifle, Vincent Pilaud, Francisco Santos

Publication date: 21 January 2013

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1009.1499

zbMATH Keywords

non-polytopal graphspolytopality of graphs

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Graph operations (line graphs, products, etc.) (05C76)

Related Items

On 3‐polytopes with non‐Hamiltonian prisms, The linkedness of cubical polytopes: beyond the cube, Positive Plücker tree certificates for non-realizability, Polyhedral graph abstractions and an approach to the linear Hirsch conjecture, Unnamed Item, Design of parameter-scheduled state-feedback controllers using shifting specifications, Graphs, skeleta and reconstruction of polytopes, The linkedness of cubical polytopes: the cube

Cites Work

• Prodsimplicial-neighborly polytopes
• On the graph structure of convex polyhedra in \(n\)-space
• Construction and analysis of projected deformed products
• Connectivity of Cartesian products of graphs
• Finding a simple polytope from its graph in polynomial time
• Puzzles and polytope isomorphisms
• A simple way to tell a simple polytope from its graph
• On connectivity of the cartesian product of two graphs
• Neighborly cubical polytopes
• A necessary condition for d-polyhedrality
• Realization spaces of polytopes
• Lectures on Polytopes
• Non-Separable and Planar Graphs
• Projected products of polygons
• Unnamed Item
• Unnamed Item