The Weisfeiler-Leman algorithm and recognition of graph properties
From MaRDI portal
Recommendations
- The Weisfeiler-Leman algorithm and recognition of graph properties
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties
- Identifiability of graphs with small color classes by the Weisfeiler-Leman algorithm
- On the combinatorial power of the Weisfeiler-Lehman algorithm
- The power of the Weisfeiler-Leman algorithm to decompose graphs
Cites work
- 6-transitive graphs
- A criterion for the \(t\)-vertex condition of graphs
- An optimal lower bound on the number of variables for graph identification
- Characterization of families of rank 3 permutation groups by the subdegrees. II
- Circulant graphs: recognizing and isomorphism testing in polynomial time
- Connectivity of transitive graphs
- Constructing an infinite family of cubic 1-regular graphs
- Cubic Ramanujan graphs
- Expander graphs and their applications
- Fixed-point definability and polynomial time on graphs with excluded minors
- Forestal algebras and algebraic forests (on a new class of weakly compact graphs)
- Graph isomorphism in quasipolynomial time (extended abstract)
- Homogeneity conditions in graphs
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 50655 (Why is no real title available?)
- scientific article; zbMATH DE number 193034 (Why is no real title available?)
- scientific article; zbMATH DE number 524145 (Why is no real title available?)
- scientific article; zbMATH DE number 863496 (Why is no real title available?)
- Isomorphism problem for a class of point-symmetric structures
- Logical hierarchies in PTIME
- On highly closed cellular algebras and highly closed isomorphisms
- On pseudocyclic association schemes
- On the combinatorial power of the Weisfeiler-Lehman algorithm
- On weakly symmetric graphs of order twice a prime
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties
- Point-symmetric graphs and digraphs of prime order and transitive permutation groups of prime degree
- Point-symmetric graphs with a prime number of points
- Recognizing circulant graphs of prime order in polynomial time
- Spectra of graphs
- The first order definability of graphs: Upper bounds for quantifier depth
- The isomorphism problem for circulant graphs via Schur ring theory
- The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3
- The Weisfeiler-Leman algorithm and recognition of graph properties
Cited in
(15)- Local WL invariance and hidden shades of regularity
- The Weisfeiler-Leman algorithm and the diameter of Schreier graphs
- Identifiability of graphs with small color classes by the Weisfeiler-Leman algorithm
- The power of the Weisfeiler-Leman algorithm to decompose graphs
- The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs
- On the Weisfeiler-Leman dimension of finite groups
- On the combinatorial power of the Weisfeiler-Lehman algorithm
- Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm
- On Weisfeiler-Leman invariance: subgraph counts and related graph properties
- The Weisfeiler-Leman algorithm and recognition of graph properties
- Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas
- Weisfeiler-Leman indistinguishability of graphons
- Canonization of a random circulant graph by counting walks
- Edge-transitive cubic graphs: analysis, cataloguing and enumeration
- A large family of strongly regular graphs with small Weisfeiler-Leman dimension
This page was built for publication: The Weisfeiler-Leman algorithm and recognition of graph properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925529)
