Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158)
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 5648183
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs without adjacent cycles of length at most seven are 3-colorable |
scientific article; zbMATH DE number 5648183 |
Statements
Planar graphs without adjacent cycles of length at most seven are 3-colorable (English)
0 references
15 December 2009
0 references
the 3-color problem
0 references
0 references
0 references
0.9417800307273864
0 references
0.9361755847930908
0 references
0.9275823831558228
0 references
0.9211100339889526
0 references
0.9173778295516968
0 references
