Pages that link to "Item:Q5462386"
From MaRDI portal
The following pages link to Coloring graphs from lists with bounded size of their union (Q5462386):
Displaying 11 items.
- A note on list-coloring powers of graphs (Q400353) (← links)
- On \((k, k n - k^2 - 2 k - 1)\)-choosability of \(n\)-vertex graphs (Q1751381) (← links)
- Proportional 2-choosability with a bounded palette (Q2071248) (← links)
- List supermodular coloring with shorter lists (Q2322511) (← links)
- On \((k,t)\)-choosability of graphs. (Q2918630) (← links)
- List Coloring with a Bounded Palette (Q2958200) (← links)
- Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs (Q3559384) (← links)
- (Q4888118) (← links)
- Improper Choosability and Property B (Q5325946) (← links)
- Coloring bipartite graphs with semi-small list size (Q6065679) (← links)
- On two problems of defective choosability of graphs (Q6657596) (← links)