A Tutte-type canonical decomposition of 3- and 4-connected graphs
By: Jan Kurkofka, Tim Planken
Potential Business Impact:
Breaks down complex shapes into simpler parts.
We provide a unique decomposition of every 4-connected graph into parts that are either quasi-5-connected, cycles of triangle-torsos and 3-connected torsos on $\leq 5$ vertices, generalised double-wheels, or thickened $K_{4,m}$'s. The decomposition can be described in terms of a tree-decomposition but with edges allowed in the adhesion-sets. Our construction is explicit, canonical, and exhibits a defining property of the Tutte-decomposition. As a corollary, we obtain a new Tutte-type canonical decomposition of 3-connected graphs into parts that are either quasi-4-connected, generalised wheels or thickened $K_{3,m}$'s. This decomposition is similar yet different from the tri-separation decomposition. As an application of the decomposition for 4-connectivity, we obtain a new theorem characterising all quasi-4-connected vertex-transitive finite graphs as essentially quasi-5-connected or on a short explicit list of graphs.
Similar Papers
A Structural Linear-Time Algorithm for Computing the Tutte Decomposition
Data Structures and Algorithms
Simplifies complex networks for faster computer analysis.
On graphs coverable by chubby shortest paths
Combinatorics
Finds patterns in networks for better computer problem-solving.
$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
Combinatorics
Makes complex networks simpler to understand.