Planar graphs without cycles of length from 4 to 7 are 3-colorable (Q1767673)
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 2142252
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs without cycles of length from 4 to 7 are 3-colorable |
scientific article; zbMATH DE number 2142252 |
Statements
Planar graphs without cycles of length from 4 to 7 are 3-colorable (English)
0 references
8 March 2005
0 references
Planar graphs
0 references
3-coloring
0 references
Steinberg's conjecture
0 references
0 references
0.97389406
0 references
0.96832937
0 references
0.9612324
0 references
0.96067923
0 references
0.9522754
0 references
0.95059514
0 references
0.9496625
0 references
0.94849354
0 references
0.9463041
0 references
0.94379246
0 references
