The Weisfeiler–Leman Dimension of Distance-Hereditary Graphs

A graph is said to be distance-hereditary if the distance function in every connected induced subgraph is the same as in the graph itself. We prove that the ordinary Weisfeiler-Leman algorithm correctly tests the isomorphism of any two graphs if one of them is distance-hereditary; more precisely, the Weisfeiler-Leman dimension of the class of finite distance-hereditary graphs is equal to $2$. The previously best known upper bound for the dimension was $7$.

[1]  Neil Immerman,et al.  An optimal lower bound on the number of variables for graph identification , 1989, 30th Annual Symposium on Foundations of Computer Science.

[2]  Sang-il Oum,et al.  Rank-width and vertex-minors , 2005, J. Comb. Theory, Ser. B.

[3]  Shin-Ichi Nakano,et al.  A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs , 2007, TAMC.

[4]  D. G. Higman.  Coherent configurations , 1975 .

[5]  Gottfried Tinhofer,et al.  Forestal algebras and algebraic forests (on a new class of weakly compact graphs) , 2000, Discret. Math..

[6]  Brendan D. McKay,et al.  Graph Isomorphism , 2016, Encyclopedia of Algorithms.

[7]  Martin Grohe,et al.  A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus , 2019, ICALP.

[8]  Pascal Schweitzer,et al.  The Weisfeiler-Leman dimension of planar graphs is at most 3 , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[9]  Bireswar Das,et al.  Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three , 2016, COCOON.

[10]  Neil Immerman,et al.  Descriptive Complexity , 1999, Graduate Texts in Computer Science.

[11]  Martin Grohe,et al.  Descriptive Complexity, Canonisation, and Definable Graph Structure Theory , 2017, Lecture Notes in Logic.

[12]  Hans-Jürgen Bandelt,et al.  Distance-hereditary graphs , 1986, J. Comb. Theory, Ser. B.

[13]  E. Howorka.  A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS , 1977 .

[14]  Oleg Verbitsky,et al.  Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm , 2019, STACS.

[15]  Martin Grohe,et al.  Canonisation and Definability for Graphs of Bounded Rank Width , 2019, 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[16]  Oleg Verbitsky,et al.  Graph Isomorphism, Color Refinement, and Compactness , 2015, computational complexity.