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

DOI10.1016/J.DISC.2010.05.022MaRDI QIDQ708406zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A lower bound for the chromatic capacity in terms of the chromatic number of a graph
• Chromatic capacities of graphs and hypergraphs
• Chromatic capacity and graph operations
• Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number
• A short construction of highly chromatic digraphs without short cycles

Cites work

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

Cited in

(7)

• The Adaptable Chromatic Number and the Chromatic Number
• Chromatic capacities of graphs and hypergraphs
• Chromatic capacity and graph operations
• On color critical graphs with large adaptable chromatic numbers
• New construction of graphs with high chromatic number and small clique number
• scientific article; zbMATH DE number 1500656 (Why is no real title available?)
• A lower bound for the chromatic capacity in terms of the chromatic number of a graph

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

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