How well can a graph be n-colored?
From MaRDI portal
Publication:1148324
DOI10.1016/0012-365X(81)90023-6zbMath0452.05026WikidataQ92200966 ScholiaQ92200966MaRDI QIDQ1148324
Publication date: 1981
Published in: Discrete Mathematics (Search for Journal in Brave)
Stirling number of the second kind; NP-complete problem; equicoloured complete graph; Erdős-graph; n-colourability coefficient of a graph
05C15: Coloring of graphs and hypergraphs
Related Items
Cites Work