Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860)
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 6617200
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable |
scientific article; zbMATH DE number 6617200 |
Statements
Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (English)
0 references
16 August 2016
0 references
planar graph
0 references
\((d_1,d_2,\ldots,d_k)\)-coloring
0 references
reducible configuration
0 references
discharging
0 references
0 references
0 references
0 references
0 references
0.9504067897796632
0 references
0.9445839524269104
0 references
0.896655261516571
0 references
0.8932666182518005
0 references
