Tiling edge-coloured graphs with few monochromatic bounded-degree graphs (Q6621182)
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: Tiling edge-coloured graphs with few monochromatic bounded-degree graphs |
scientific article; zbMATH DE number 7928497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tiling edge-coloured graphs with few monochromatic bounded-degree graphs |
scientific article; zbMATH DE number 7928497 |
Statements
Tiling edge-coloured graphs with few monochromatic bounded-degree graphs (English)
0 references
18 October 2024
0 references
tiling
0 references
vertex-partitioning
0 references
0.9993796348571776
0 references
0.8285221457481384
0 references
0.8121745586395264
0 references
0.810665488243103
0 references
