List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly (Q2297730)
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 7170107
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly |
scientific article; zbMATH DE number 7170107 |
Statements
List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly (English)
0 references
20 February 2020
0 references
clique hypergraph
0 references
planar graph
0 references
linear-time algorithm
0 references
list coloring
0 references
\( K_5\)-minor
0 references
0.8156886696815491
0 references
0.7989222407341003
0 references
0.7927901744842529
0 references
0.7927901744842529
0 references
0.7846925854682922
0 references
