The Adaptable Chromatic Number and the Chromatic Number
From MaRDI portal
Publication:2958198
DOI10.1002/jgt.22011zbMath1358.05115OpenAlexW2233935823MaRDI QIDQ2958198
No author found.
Publication date: 1 February 2017
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22011
coloringchromatic capacityadaptable coloringadaptable chromatic numbersplit coloringemulsive coloring
Related Items
On color critical graphs with large adaptable chromatic numbers, Adaptable and conflict colouring multigraphs with no cycles of length three or four, Cooperative colorings of forests
Cites Work
- A lower bound for the chromatic capacity in terms of the chromatic number of a graph
- The adaptable choosability number grows with the choosability number
- On a construction of graphs with high chromatic capacity and large girth
- Adaptable chromatic number of graph products
- On a graph colouring problem
- Split and balanced colorings of complete graphs
- Chromatic capacities of graphs and hypergraphs
- On the upper chromatic numbers of the reals
- On the adaptable chromatic number of graphs
- Chromatic capacity and graph operations
- On splittable colorings of graphs and hypergraphs
- Adapted List Coloring of Graphs and Hypergraphs
- Adapted list coloring of planar graphs
- An asymptotically tight bound on the adaptable chromatic number
