On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) (Q1999744)
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 7074166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) |
scientific article; zbMATH DE number 7074166 |
Statements
On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) (English)
0 references
27 June 2019
0 references
choosability with separation
0 references
planar graph
0 references
List coloring
0 references
cycle
0 references
0.9427202343940736
0 references
0.9233028888702391
0 references
0.9218182563781738
0 references
0.910204529762268
0 references
0.9006261825561523
0 references
