The Adaptable Chromatic Number and the Chromatic Number

DOI10.1002/JGT.22011MaRDI QIDQ2958198zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

adaptable chromatic numberadaptable coloringchromatic capacitycoloringemulsive coloringsplit coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• An asymptotically tight bound on the adaptable chromatic number
• Chromatic capacity and graph operations
• On the adaptable chromatic number of graphs
• A lower bound for the chromatic capacity in terms of the chromatic number of a graph
• Adaptable chromatic number of graph products
• The adaptable choosability number grows with the choosability number
• Coloring graphs with sparse neighborhoods
• On the upper chromatic numbers of the reals
• Adapted game colouring of graphs
• Asymptotically optimal frugal colouring

Cites work

• A lower bound for the chromatic capacity in terms of the chromatic number of a graph
• Adaptable chromatic number of graph products
• Adapted List Coloring of Graphs and Hypergraphs
• Adapted list coloring of planar graphs
• An asymptotically tight bound on the adaptable chromatic number
• Chromatic capacities of graphs and hypergraphs
• Chromatic capacity and graph operations
• On a construction of graphs with high chromatic capacity and large girth
• On a graph colouring problem
• On splittable colorings of graphs and hypergraphs
• On the adaptable chromatic number of graphs
• On the upper chromatic numbers of the reals
• Split and balanced colorings of complete graphs
• The adaptable choosability number grows with the choosability number

Cited in

(11)

• Adaptable chromatic number of graph products
• On color critical graphs with large adaptable chromatic numbers
• On the adaptable chromatic number of graphs
• Cooperative colorings of forests
• A lower bound for the chromatic capacity in terms of the chromatic number of a graph
• An asymptotically tight bound on the adaptable chromatic number
• Adaptable and conflict colouring multigraphs with no cycles of length three or four
• The adaptable choosability number grows with the choosability number
• Cooperative coloring of some graph families
• Single-conflict colorings of degenerate graphs
• Single-conflict colorings of degenerate graphs (extended abstract)

This page was built for publication: The Adaptable Chromatic Number and the Chromatic Number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958198)