A formal proof of the minor-exclusion property for treewidth-two graphs (Q1791156)
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 6946980
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A formal proof of the minor-exclusion property for treewidth-two graphs |
scientific article; zbMATH DE number 6946980 |
Statements
A formal proof of the minor-exclusion property for treewidth-two graphs (English)
0 references
4 October 2018
0 references
graph theory
0 references
graph minor theorem
0 references
Coq
0 references
Ssreflect
0 references
0.8399001359939575
0 references
0.7969297766685486
0 references
0.7354300022125244
0 references
0.7049525380134583
0 references