Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult (Q2498403)
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: Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult |
scientific article; zbMATH DE number 5046831
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult |
scientific article; zbMATH DE number 5046831 |
Statements
Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult (English)
0 references
16 August 2006
0 references
0.850130558013916
0 references
0.847851037979126
0 references
0.8460158705711365
0 references
0.8306983709335327
0 references
