The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs

Recommendations

The power of the Weisfeiler-Leman algorithm to decompose graphs
The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3
On the Weisfeiler-Leman dimension of fractional packing
The Weisfeiler-Leman algorithm and recognition of graph properties
The Weisfeiler-Leman dimension of planar graphs is at most 3

Cites work

A\,V^ 2 algorithm for determining isomorphism of planar graphs
A V log V algorithm for isomorphism of triconnected planar graphs
An optimal lower bound on the number of variables for graph identification
Complexity of Finding Embeddings in a k-Tree
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
Dividing a Graph into Triconnected Components
Fixed-point definability and polynomial time on graphs with excluded minors
Graph isomorphism for unit square graphs
Graph isomorphism in quasipolynomial time (extended abstract)
scientific article; zbMATH DE number 997668 (Why is no real title available?)
scientific article; zbMATH DE number 3882430 (Why is no real title available?)
scientific article; zbMATH DE number 3823850 (Why is no real title available?)
scientific article; zbMATH DE number 3575612 (Why is no real title available?)
Isomorphism of planar graphs (working paper)
Logical hierarchies in PTIME
Lov\'asz Meets Weisfeiler and Leman
On the combinatorial power of the Weisfeiler-Lehman algorithm
On the connectivity of graphs in association schemes
On Weisfeiler-Leman invariance: subgraph counts and related graph properties
PEBBLE GAMES AND LINEAR EQUATIONS
Practical graph isomorphism. II.
Sherali-Adams relaxations and indistinguishability in counting logics
The connectivity of strongly regular graphs
The Power of Counting Logics on Restricted Classes of Finite Structures
The vertex-connectivity of a distance-regular graph
The Weisfeiler-Leman dimension of planar graphs is at most 3

Cited in

(7)

On the Power of the Semi-Separated Pair Decomposition
The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3
On the Weisfeiler-Leman dimension of fractional packing
On the complexity of identifying strongly regular graphs
The Weisfeiler-Leman dimension of distance-hereditary graphs
Canonization for bounded and dihedral color classes in choiceless polynomial time
Logarithmic Weisfeiler-Leman identifies all planar graphs

This page was built for publication: The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092407)