REVIEW 3 cited by
Regularity and separation for Sierpi\'nski products of graphs
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
abstract
The Sierpi\'nski product of graphs generalises the vast and relevant class of Sierpi\'nski-type graphs, and is also related to the classic lexicographic product of graphs. Our first main results are necessary and sufficient conditions for the higher connectivity of Sierpi\'nski products. Among other applications, we characterise the polyhedral ($3$-connected and planar) Sierpi\'nski products of polyhedra. Our other main result is the complete classification of the regular polyhedral Sierpi\'nski products, and more generally of the regular, connected, planar Sierpi\'nski products. To prove this classification, we introduce and study the intriguing class of planar graphs where each vertex may be assigned a colour in such a way that each vertex has neighbours of the same set of colours and in the same cyclic order around the vertex. We also completely classify the planar lexicographic products.
Forward citations
Cited by 3 Pith papers
-
Automorphism Groups in Extremal Families of Polyhedral Graphs
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.
-
Classification of polyhedral graphs by numbers of common neighbours
Every polyhedron is classified by its set of pair common-neighbour counts, with a complete trichotomy for every finite set of counts.
-
On Sierpi\'{n}ski packing chromatic number and recognition of Sierpi\'{n}ski products
For Sierpiński products of complete graphs, paths, and stars, the paper determines or bounds the minimum and maximum packing chromatic number over all connecting functions, and gives a polynomial-time recognition algo...
Discussion (0). Continue with ORCID to comment.