Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width (Q6094029)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width |
scientific article; zbMATH DE number 7747409
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width |
scientific article; zbMATH DE number 7747409 |
Statements
Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width (English)
0 references
9 October 2023
0 references
cubic graph
0 references
girth
0 references
path-width
0 references
unavoidable structure
0 references
0.7042616009712219
0 references
0.6900702118873596
0 references
0.6674660444259644
0 references
0.6620507836341858
0 references
0.6527435779571533
0 references
