\(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum

DOI10.7151/dmgt.1891zbMath1339.05116arXiv1508.01759MaRDI QIDQ726653

Zsolt Tuza, Csilla Bujtás

Publication date: 13 July 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.01759

zbMATH Keywords

feasible set; WORM coloring; gap in the chromatic spectrum; lower chromatic number

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)