Choosability with separation of planar graphs without prescribed cycles (Q2284787)
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 7151611
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Choosability with separation of planar graphs without prescribed cycles |
scientific article; zbMATH DE number 7151611 |
Statements
Choosability with separation of planar graphs without prescribed cycles (English)
0 references
15 January 2020
0 references
choosability with separation
0 references
planar graphs
0 references
list coloring
0 references
adjacent cycles
0 references
0.9406107664108276
0 references
0.9338976144790648
0 references
0.910204529762268
0 references
0.8894591927528381
0 references
0.8861715197563171
0 references
