The following pages link to On a graph colouring problem (Q1297488):
Displayed 7 items.
- A lower bound for the chromatic capacity in terms of the chromatic number of a graph (Q390289) (← links)
- Adapted game colouring of graphs (Q412230) (← links)
- Adaptable chromatic number of graph products (Q1045010) (← links)
- Adaptable choosability of planar graphs with sparse short cycles (Q1045097) (← links)
- Chromatic capacities of graphs and hypergraphs (Q1827711) (← links)
- The Adaptable Chromatic Number and the Chromatic Number (Q2958198) (← links)
- Adapted list coloring of planar graphs (Q3652546) (← links)