# The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs

The Weisfeiler-Leman procedure is a widely-used approach for graph isomorphism testing that works by iteratively computing an isomorphism-invariant coloring of vertex tuples. Meanwhile, a fundamental tool in structural graph theory, which is often exploited in approaches to tackle the graph isomorphism problem, is the decomposition into 2- and 3-connected components. We prove that the 2-dimensional Weisfeiler-Leman algorithm implicitly computes the decomposition of a graph into its 3-connected components. Thus, the dimension of the algorithm needed to distinguish two given graphs is at most the dimension required to distinguish the corresponding decompositions into 3-connected components (assuming it is at least 2). This result implies that for k >= 2, the k-dimensional algorithm distinguishes k-separators, i.e., k-tuples of vertices that separate the graph, from other vertex k-tuples. As a byproduct, we also obtain insights about the connectivity of constituent graphs of association schemes. In an application of the results, we show the new upper bound of k on the Weisfeiler-Leman dimension of graphs of treewidth at most k. Using a construction by Cai, Fürer, and Immerman, we also provide a new lower bound that is asymptotically tight up to a factor of 2.

• 11 publications
• 21 publications
research
04/03/2023

### Canonical decompositions of 3-connected graphs

We offer a new structural basis for the theory of 3-connected graphs, pr...
research
08/24/2017

### The Weisfeiler-Leman Dimension of Planar Graphs is at most 3

We prove that the Weisfeiler-Leman (WL) dimension of the class of all fi...
research
09/19/2019

### Lower Bound for (Sum) Coloring Problem

The Minimum Sum Coloring Problem is a variant of the Graph Vertex Colori...
research
02/18/2020

### Dynamics of Cycles in Polyhedra I: The Isolation Lemma

A cycle C of a graph G is isolating if every component of G-V(C) is a si...
research
02/11/2020

### Local WL Invariance and Hidden Shades of Regularity

The k-dimensional Weisfeiler-Leman algorithm (k-WL) is a powerful tool f...
research
02/17/2019

### Enumerating Unique Computational Graphs via an Iterative Graph Invariant

In this report, we describe a novel graph invariant for computational gr...
research
06/21/2019

### Multidimensional Dominance Drawings

Let G be a DAG with n vertices and m edges. Two vertices u,v are incompa...