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 9 items.
- Covering graphs with few complete bipartite subgraphs (Q1019181) (← 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)
- Locally bounded<i>k</i>-colorings of trees (Q3621974) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
- Covering Graphs with Few Complete Bipartite Subgraphs (Q5458846) (← links)
- List 3-coloring on comb-convex and caterpillar-convex bipartite graphs (Q6591467) (← links)
