Classification and Construction of Planar, 3-Connected Kronecker Products
Abstract
We give a complete classification of the Kronecker (i.e. direct) product graphs that are planar and -connected (i.e. -polytopal). They are all of the form where is a -connected graph, possibly non-planar, and satisfying specific properties that we will describe. Our proof is constructive, in the sense that we prescribe how to obtain all such graphs , by adding a few edges in a specific way to a given planar, bipartite graph, that is either -connected, or semi-hyper--connected. Moreover, for planar, we also give a more precise characterisation of this graph, regarding the number of its odd regions, and how they intersect. If is a -polytope, then we have , so that the connectivity of is , and the connectivity of is either or . We also briefly discuss which Cartesian and strong products are -polytopal.
Keywords
Cite
@article{arxiv.2402.01407,
title = {Classification and Construction of Planar, 3-Connected Kronecker Products},
author = {Riccardo W. Maffucci},
journal= {arXiv preprint arXiv:2402.01407},
year = {2024}
}