Polytopality and Cartesian products of graphs
Metric Geometry
2013-04-30 v1 Combinatorics
Abstract
We study the question of polytopality of graphs: when is a given graph the graph of a polytope? We first review the known necessary conditions for a graph to be polytopal, and we provide several families of graphs which satisfy all these conditions, but which nonetheless are not graphs of polytopes. Our main contribution concerns the polytopality of Cartesian products of non-polytopal graphs. On the one hand, we show that products of simple polytopes are the only simple polytopes whose graph is a product. On the other hand, we provide a general method to construct (non-simple) polytopal products whose factors are not polytopal.
Keywords
Cite
@article{arxiv.1009.1499,
title = {Polytopality and Cartesian products of graphs},
author = {Julian Pfeifle and Vincent Pilaud and Francisco Santos},
journal= {arXiv preprint arXiv:1009.1499},
year = {2013}
}
Comments
21 pages, 10 figures