Planar graphs without cycles of length 4 or 7 are \((2, 0, 0)\)-colorable (Q5017899)
From MaRDI portal
!
WARNING
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 7449216
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs without cycles of length 4 or 7 are \((2, 0, 0)\)-colorable |
scientific article; zbMATH DE number 7449216 |
Statements
Planar graphs without cycles of length 4 or 7 are (2, 0, 0)-colorable (English)
0 references
17 December 2021
0 references
planar graph
0 references
cycle
0 references
improper coloring
0 references
0.9651037454605104
0 references
0.964031219482422
0 references
0.9584604501724244
0 references
0.9456798434257508
0 references
0.9447746276855468
0 references
