On color critical graphs with large adaptable chromatic numbers

DOI10.1007/s00373-017-1833-0zbMath1380.05082OpenAlexW2739099791MaRDI QIDQ1684934

Bing Zhou

Publication date: 12 December 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1833-0

zbMATH Keywords

critical graphscoloringadaptable coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• A lower bound for the chromatic capacity in terms of the chromatic number of a graph
• Adapted game colouring of graphs
• 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
• 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
• The Adaptable Chromatic Number and the Chromatic Number
• Adapted List Coloring of Graphs and Hypergraphs
• Adapted list coloring of planar graphs
• An asymptotically tight bound on the adaptable chromatic number
• Some Theorems on Abstract Graphs
• The structure of k-chromatic graphs

This page was built for publication: On color critical graphs with large adaptable chromatic numbers