Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles (Q324868)
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 6639927
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles |
scientific article; zbMATH DE number 6639927 |
Statements
Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles (English)
0 references
17 October 2016
0 references
Steinberg conjecture
0 references
graph colouring
0 references
planar graphs
0 references
0.95733595
0 references
0.93364596
0 references
0.9331912
0 references
0 references
0.93125314
0 references
0.9312181
0 references
0.9267664
0 references
0.92469776
0 references
0.9245572
0 references
