Gallai's theorem for list coloring of digraphs (Q3094906)
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 5964587
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Gallai's theorem for list coloring of digraphs |
scientific article; zbMATH DE number 5964587 |
Statements
Gallai's Theorem for List Coloring of Digraphs (English)
0 references
27 October 2011
0 references
digraph coloring
0 references
dichromatic number
0 references
list coloring
0 references
Gallai tree
0 references
algorithmic complexity
0 references
NP-complete
0 references
critical digraph
0 references
0.8021243214607239
0 references
0.7596206665039062
0 references
0.7590742111206055
0 references
0.7578297257423401
0 references
0.7578297257423401
0 references
