Pages that link to "Item:Q2958198"
From MaRDI portal
The following pages link to The Adaptable Chromatic Number and the Chromatic Number (Q2958198):
Displaying 9 items.
- A lower bound for the chromatic capacity in terms of the chromatic number of a graph (Q390289) (← links)
- The adaptable choosability number grows with the choosability number (Q641204) (← links)
- Adaptable chromatic number of graph products (Q1045010) (← links)
- On color critical graphs with large adaptable chromatic numbers (Q1684934) (← links)
- On the adaptable chromatic number of graphs (Q2427540) (← links)
- Cooperative colorings of forests (Q2684895) (← links)
- An asymptotically tight bound on the adaptable chromatic number (Q4650185) (← links)
- Adaptable and conflict colouring multigraphs with no cycles of length three or four (Q6047975) (← links)
- Cooperative coloring of some graph families (Q6542008) (← links)