A lower bound for the chromatic capacity in terms of the chromatic number of a graph

DOI10.1016/j.disc.2013.05.012zbMath1281.05066OpenAlexW2137962531MaRDI QIDQ390289

Bing Zhou

Publication date: 23 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.05.012

zbMATH Keywords

chromatic numbervertex colouringedge colouringchromatic capacity

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)

Related Items (2)

On color critical graphs with large adaptable chromatic numbers ⋮ The Adaptable Chromatic Number and the Chromatic Number

Cites Work

• On a construction of graphs with high chromatic capacity and large girth
• 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
• Chromatic capacity and graph operations
• On splittable colorings of graphs and hypergraphs

This page was built for publication: A lower bound for the chromatic capacity in terms of the chromatic number of a graph