A tight bound on the set chromatic number

DOI10.7151/DMGT.1679zbMATH Open1293.05124OpenAlexW2083219263MaRDI QIDQ2860873FDOQ2860873

Authors: Jean-Sébastien Sereni, Zelealem B. Yilma 

Publication date: 11 November 2013

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

Full work available at URL: https://doi.org/10.7151/dmgt.1679

Recommendations

• The set chromatic number of a graph
• Set colourings of graphs. (Reprint)
• scientific article; zbMATH DE number 2099158
• New bounds for the chromatic number of graphs
• Tight bounds on the clique chromatic number

zbMATH Keywords

chromatic numberset chromatic numberneighborset coloringdistinguishing coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (2)

• The set chromatic number of random graphs
• A bound on the total chromatic number

This page was built for publication: A tight bound on the set chromatic number

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