On a construction of graphs with high chromatic capacity and large girth

DOI10.1016/j.disc.2010.05.022zbMath1216.05042OpenAlexW1994013009MaRDI QIDQ708406

Bing Zhou

Publication date: 11 October 2010

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

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

zbMATH Keywords

chromatic numbergirthconstructionchromatic capacity

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

A lower bound for the chromatic capacity in terms of the chromatic number of a graph ⋮ On color critical graphs with large adaptable chromatic numbers ⋮ The Adaptable Chromatic Number and the Chromatic Number

Cites Work

• A short proof of the existence of highly chromatic hypergraphs without short cycles
• Chromatic capacities of graphs and hypergraphs
• On the upper chromatic numbers of the reals
• Chromatic capacity and graph operations
• Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number
• On chromatic number of graphs and set-systems
• On chromatic number of finite set-systems

This page was built for publication: On a construction of graphs with high chromatic capacity and large girth