Pages that link to "Item:Q1348378"
From MaRDI portal
The following pages link to Complexity of list coloring problems with a fixed total number of colors (Q1348378):
Displaying 18 items.
- Covering graphs with few complete bipartite subgraphs (Q1019181) (← links)
- On the complexity of a restricted list-coloring problem (Q1296975) (← links)
- Algorithmic complexity of list colorings (Q1327214) (← links)
- Asymptotically the list colouring constants are 1 (Q1850621) (← 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)
- (Q3115020) (← links)
- Approximating List-Coloring on a Fixed Surface (Q3521930) (← links)
- Locally bounded<i>k</i>-colorings of trees (Q3621974) (← links)
- Near-optimal list colorings (Q4521554) (← links)
- A Complexity Trichotomy for Approximately Counting List <i>H</i> -Colorings (Q4973886) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
- Space complexity of list <i>H</i>-colouring: a dichotomy (Q5383985) (← links)
- Covering Graphs with Few Complete Bipartite Subgraphs (Q5458846) (← links)
- Exploring the complexity boundary between coloring and list-coloring (Q5899384) (← links)
- List 3-coloring on comb-convex and caterpillar-convex bipartite graphs (Q6591467) (← links)