Canonical decompositions of 3-connected graphs

Research output: Working paper/PreprintPreprint

24 Downloads (Pure)

Abstract

We offer a new structural basis for the theory of 3-connected graphs, providing a unique decomposition of every such graph into parts that are either quasi 4-connected, wheels, or thickened K3,m 's. Our construction is explicit, canonical, and has the following applications: we obtain a new theorem characterising all Cayley graphs as either essentially 4-connected, cycles, or complete graphs on at most four vertices, and we provide an automatic proof of Tutte's wheel theorem.
Original languageEnglish
PublisherarXiv
DOIs
Publication statusPublished - 3 Apr 2023

Fingerprint

Dive into the research topics of 'Canonical decompositions of 3-connected graphs'. Together they form a unique fingerprint.

Cite this