On choosability with separation of planar graphs without adjacent short cycles (Q723623)
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 6909792
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On choosability with separation of planar graphs without adjacent short cycles |
scientific article; zbMATH DE number 6909792 |
Statements
On choosability with separation of planar graphs without adjacent short cycles (English)
0 references
24 July 2018
0 references
planar graphs
0 references
choosability with separation
0 references
list coloring
0 references
cycles
0 references
0.9563823342323304
0 references
0.9427202343940736
0 references
0.9406107664108276
0 references
0.92902010679245
0 references
0.9279740452766418
0 references
