English

Classification and Construction of Planar, 3-Connected Kronecker Products

Combinatorics 2024-02-05 v1

Abstract

We give a complete classification of the Kronecker (i.e. direct) product graphs that are planar and 33-connected (i.e. 33-polytopal). They are all of the form HK2,H\wedge K_2, where HH is a 22-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 HH, by adding a few edges in a specific way to a given planar, bipartite graph, that is either 33-connected, or semi-hyper-22-connected. Moreover, for HH planar, we also give a more precise characterisation of this graph, regarding the number of its odd regions, and how they intersect. If HK2H\wedge K_2 is a 33-polytope, then we have δ(HK2)=3\delta(H\wedge K_2)=3, so that the connectivity of HK2H\wedge K_2 is 33, and the connectivity of HH is either 22 or 33. We also briefly discuss which Cartesian and strong products are 33-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}
}
R2 v1 2026-06-28T14:35:51.318Z