The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3 (Q5215472)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7165896
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3 |
scientific article; zbMATH DE number 7165896 |
Statements
The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3 (English)
0 references
11 February 2020
0 references
first-order logic with counting
0 references
Weisfeiler-Leman algorithm
0 references
isomorphism testing
0 references
planar graphs
0 references
0.9156766
0 references
0.8290946
0 references
0.82237583
0 references
0.7862165
0 references
0.7830529
0 references
0.7562107
0 references
0.7424412
0 references
0.7397983
0 references
