Polyhedral (planar, 3-connected) graphs are Kronecker products in at most one way, and the polyhedra expressible as Cartesian or Kronecker products in multiple ways are classified.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Cancellation and regularity for planar, 3-connected Kronecker products
Polyhedral (planar, 3-connected) graphs are Kronecker products in at most one way, and the polyhedra expressible as Cartesian or Kronecker products in multiple ways are classified.