Pages that link to "Item:Q2427540"
From MaRDI portal
The following pages link to On the adaptable chromatic number of graphs (Q2427540):
Displaying 16 items.
- Algorithms to approximately count and sample conforming colorings of graphs (Q299070) (← links)
- Adapted game colouring of graphs (Q412230) (← links)
- The adaptable choosability number grows with the choosability number (Q641204) (← links)
- Rainbow graph splitting (Q719272) (← links)
- An upper bound on adaptable choosability of graphs (Q1003583) (← links)
- Adaptable chromatic number of graph products (Q1045010) (← links)
- Adaptable choosability of planar graphs with sparse short cycles (Q1045097) (← links)
- On color critical graphs with large adaptable chromatic numbers (Q1684934) (← links)
- Cooperative colorings of forests (Q2684895) (← links)
- The Adaptable Chromatic Number and the Chromatic Number (Q2958198) (← links)
- Adapted list coloring of planar graphs (Q3652546) (← links)
- An asymptotically tight bound on the adaptable chromatic number (Q4650185) (← links)
- A new proof of validity of Bouchet's conjecture on Eulerian bidirected graphs (Q5134536) (← links)
- Adaptable and conflict colouring multigraphs with no cycles of length three or four (Q6047975) (← links)
- Single‐conflict colouring (Q6055933) (← links)
- Cooperative coloring of some graph families (Q6542008) (← links)
