More Results on Clique-chromatic Numbers of Graphs with No Long Path

DOI10.1007/978-3-319-13287-7_16zbMath1452.05071OpenAlexW904401343MaRDI QIDQ2945676

Tanawat Wichianpaisarn, Chariya Uiyyasathian

Publication date: 14 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13287-7_16

zbMATH Keywords

clique-coloringclique-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Two-colouring all two-element maximal antichains
• Fibres and ordered set coloring
• Coloring the hypergraph of maximal cliques of a graph with no long path
• Clique-coloring some classes of odd-hole-free graphs
• Coloring the Maximal Cliques of Graphs
• Sur le coloriage des graphs
• Colouring clique-hypergraphs of circulant graphs

This page was built for publication: More Results on Clique-chromatic Numbers of Graphs with No Long Path