Planar graphs without intersecting 5-cycles are 4-choosable (Q2397522)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Planar graphs without intersecting 5-cycles are 4-choosable |
scientific article; zbMATH DE number 6722196
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planar graphs without intersecting 5-cycles are 4-choosable |
scientific article; zbMATH DE number 6722196 |
Statements
Planar graphs without intersecting 5-cycles are 4-choosable (English)
0 references
22 May 2017
0 references
planar graph
0 references
cycle
0 references
list coloring
0 references
choosable graphs
0 references
0.9239069819450378
0 references
0.912040650844574
0 references
0.9074477553367616
0 references
0.9069854021072388
0 references
0.9057303071022034
0 references
