The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3
Reads0
Chats0
TLDR
It is proved that the Weisfeiler--Leman (WL) dimension of the class of all finite planar graphs is at most 3 and, apart from several exceptional graphs, the individualization of two appropriately chosen vertices of a colored 3-connected planar graph followed by the one-dimensional WL-algorithm produces the discrete vertex partition.Abstract:
We prove that the Weisfeiler--Leman (WL) dimension of the class of all finite planar graphs is at most 3. In particular, every finite planar graph is definable in first-order logic with counting using at most 4 variables. The previously best-known upper bounds for the dimension and number of variables were 14 and 15, respectively. First, we show that, for dimension 3 and higher, the WL-algorithm correctly tests isomorphism of graphs in a minor-closed class whenever it determines the orbits of the automorphism group of every arc-colored 3-connected graph belonging to this class. Then, we prove that, apart from several exceptional graphs (which have WL-dimension at most 2), the individualization of two appropriately chosen vertices of a colored 3-connected planar graph followed by the one-dimensional WL-algorithm produces the discrete vertex partition. This implies that the three-dimensional WL-algorithm determines the orbits of arc-colored 3-connected planar graphs. As a byproduct of the proof, we get a classification of the 3-connected planar graphs with fixing number 3.read more
Citations
More filters
Posted Content
The Surprising Power of Graph Neural Networks with Random Node Initialization
TL;DR: This paper proves that GNNs with RNI are universal, a first such result for GNN's not relying on computationally demanding higher-order properties, and empirically analyzes the effect of RNI on GNN’s, finding that the empirical findings support the superior performance of GNNS with R NI over standard Gnns.
Proceedings ArticleDOI
Canonisation and Definability for Graphs of Bounded Rank Width
Martin Grohe,Daniel Neuen +1 more
TL;DR: In this paper, it was shown that the combinatorial Weisfeiler-Leman algorithm of dimension 3k+4 is a complete isomorphism test for the class of all graphs of rank width at most k.
Book ChapterDOI
Recent advances on the graph isomorphism problem
Martin Grohe,Daniel Neuen +1 more
TL;DR: The main focus will be on Babai's quasi-polynomial time isomorphism test and subsequent developments that led to the design of isomorphicism algorithms with a quasi- polynomial parameterized running time of the from $n^{\polylog k}$, where $k$ is a graph parameter such as the maximum degree.
Proceedings ArticleDOI
The weisfeiler-leman dimension of planar graphs is at most 3
TL;DR: It is proved that the Weisfeiler-Leman (WL) dimension of the class of all finite planar graphs is at most 3, and every finitePlanar graph is definable in first-order logic with counting using at most 4 variables.
Journal ArticleDOI
The Weisfeiler-Leman algorithm: an exploration of its power
TL;DR: The proof that the 3-dimensional WL algorithm (3-WL) is able to identify every planar graph is outlined and the most important ingredients of the generalisation of the bound to graphs that are parameterised by their Euler genus are highlighted.
References
More filters
Journal ArticleDOI
Practical graph isomorphism, II
Brendan D. McKay,Adolfo Piperno +1 more
TL;DR: Traces as mentioned in this paper is a graph isomorphism algorithm based on the refinement-individualization paradigm, and it is implemented in several of the key implementations of the program nauty.
Book
Graphs on Surfaces
Bojan Mohar,Carsten Thomassen +1 more
TL;DR: This chapter discusses Embeddings Combinatorially, Contractibility, of Cycles, and the Genus Problem, which focuses on planar graphs and the Jordan Curve Theorem, and colorings of Graphs on Surfaces, which are 5-choosable.
Journal ArticleDOI
How to Draw a Graph
TL;DR: In this paper, the authors define nodally 3-connected graphs as simple and non-separable graphs, and show how to obtain a convex representation of such graphs without Kuratowski subgraphs.
Journal ArticleDOI
An optimal lower bound on the number of variables for graph identification
TL;DR: It is shown that Ω(n) variables are needed for first-order logic with counting to identify graphs onn vertices, equivalent to the (k−1)-dimensional Weisfeiler-Lehman method, and the lower bound is optimal up to multiplication by a constant.
Proceedings ArticleDOI
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
John E. Hopcroft,J. K. Wong +1 more
TL;DR: The time bound for planar graph isomorphism is improved to O(|V|) time and the algorithm can be easily extended to partition a set of planar graphs into equivalence classes of isomorphic graphs in time linear in the total number of vertices in all graphs in the set.