Pages that link to "Item:Q1296975"
From MaRDI portal
The following pages link to On the complexity of a restricted list-coloring problem (Q1296975):
Displaying 11 items.
- Consensus models: computational complexity aspects in modern approaches to the list coloring problem (Q638544) (← links)
- Some results concerning the complexity of restricted colorings of graphs (Q1186161) (← links)
- Algorithmic complexity of list colorings (Q1327214) (← links)
- Complexity of list coloring problems with a fixed total number of colors (Q1348378) (← links)
- Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs (Q2067633) (← links)
- Proportional choosability: a new list analogue of equitable coloring (Q2319722) (← links)
- Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees (Q2420639) (← links)
- Bounded max-colorings of graphs (Q2447538) (← links)
- Approximating List-Coloring on a Fixed Surface (Q3521930) (← links)
- Space complexity of list <i>H</i>-colouring: a dichotomy (Q5383985) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5899384) (← links)