Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable (Q2371269)
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 5169521
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable |
scientific article; zbMATH DE number 5169521 |
Statements
Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable (English)
0 references
2 July 2007
0 references
color-4-critical graph
0 references
Euler's formula
0 references
plane graph without triangles
0 references
0.9425473809242249
0 references
0.9307757019996644
0 references
0.9205890893936156
0 references
0.919770359992981
0 references
0.9173778295516968
0 references
