A lower bound for the chromatic capacity in terms of the chromatic number of a graph
type: Item
instance of: scholarly article
title: A lower bound for the chromatic capacity in terms of the chromatic number of a graph
zbMATH Open document ID: 1281.05066
author: Bing Zhou
published in: Discrete Mathematics
publication date: 2014-01-23T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05D10
zbMATH DE Number: 6249337
zbMATH Keywords: chromatic capacity
zbMATH Keywords: chromatic number
zbMATH Keywords: vertex colouring
zbMATH Keywords: edge colouring
MaRDI profile type: Publication
full work available at URL: j.disc.2013.05.012
OpenAlex ID: W2137962531
cites work: On the upper chromatic numbers of the reals
cites work: On a graph colouring problem
cites work: Split and balanced colorings of complete graphs
cites work: On splittable colorings of graphs and hypergraphs
cites work: Chromatic capacities of graphs and hypergraphs
cites work: Chromatic capacity and graph operations
cites work: On a construction of graphs with high chromatic capacity and large girth
DOI: 10.1016/J.DISC.2013.05.012
description: scientific article; zbMATH DE number 6249337