Graphs with large clique-chromatic numbers

DOI10.1142/S179383091550055XMaRDI QIDQ2788733zbMATH OpenFDO

Authors Tanawat Wichianpaisarn, Chariya Uiyyasathian

Publication date 22 February 2016

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

Full work available at URL https://doi.org/10.1142/S179383091550055X

zbMATH Keywords

clique coloringclique-chromatic numberMycielski's construction

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Clique-chromatic numbers of line graphs.
• More results on clique-chromatic numbers of graphs with no long path
• Clique-chromatic numbers of claw-free graphs
• New bounds on clique-chromatic numbers of Johnson graphs
• Tight bounds on the clique chromatic number

Cites work

• Clique-chromatic numbers of claw-free graphs
• Clique-chromatic numbers of line graphs.
• Clique-coloring circular-arc graphs
• Coloring the Maximal Cliques of Graphs
• Colouring clique-hypergraphs of circulant graphs
• Fibres and ordered set coloring
• The Grötzsch theorem for the hypergraph of maximal cliques
• Two-colouring all two-element maximal antichains

Cited in

(7)

• On color critical graphs with large adaptable chromatic numbers
• New construction of graphs with high chromatic number and small clique number
• Clique-chromatic numbers of line graphs.
• More results on clique-chromatic numbers of graphs with no long path
• On graphs having prescribed clique number, chromatic number, and maximum degree
• Subgraphs with a large cochromatic number
• Perfect graphs of arbitrarily large clique-chromatic number

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

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