Pith. sign in

REVIEW 2 cited by

Classification and Construction of Planar, 3-Connected Kronecker Products

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.01407 v1 pith:DRGANVIF submitted 2024-02-02 math.CO

classification math.CO
keywords connectedplanarwedgegraphclassificationconnectivityeithergive
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

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

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Cancellation and regularity for planar, 3-connected Kronecker products

    math.CO 2024-11 conditional novelty 7.0 of 10

    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.

  2. Automorphism Groups in Extremal Families of Polyhedral Graphs

    math.CO 2026-07 accept novelty 6.0 of 10

    Every minimum-order 3-polytopal graph with all degrees 3..n (n≥14) is asymmetric, and automorphism groups are classified for four other extremal polyhedral families.

Pith tools