Graphs with large clique-chromatic numbers

DOI10.1142/S179383091550055XzbMath1331.05090MaRDI QIDQ2788733

Chariya Uiyyasathian, Tanawat Wichianpaisarn

Publication date: 22 February 2016

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

Mycielski's constructionclique coloringclique-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Two-colouring all two-element maximal antichains
• Fibres and ordered set coloring
• The Grötzsch theorem for the hypergraph of maximal cliques
• Clique-Coloring Circular-Arc Graphs
• Coloring the Maximal Cliques of Graphs
• Colouring clique-hypergraphs of circulant graphs

This page was built for publication: Graphs with large clique-chromatic numbers