Clique-Coloring Circular-Arc Graphs

DOI10.1016/j.endm.2009.11.047zbMath1268.05067OpenAlexW2079160463MaRDI QIDQ2840551

Márcia R. Cerioli, André L. Korenchendler

Publication date: 19 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.047

zbMATH Keywords

graph theoryinterval graphcircular-arc graphclique-coloring

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Structural parameterizations of clique coloring ⋮ Clique-coloring claw-free graphs ⋮ New bounds on clique-chromatic numbers of Johnson graphs ⋮ Clique colourings of geometric graphs ⋮ Clique coloring \(B_1\)-EPG graphs ⋮ A linear-time algorithm for clique-coloring problem in circular-arc graphs ⋮ Unnamed Item ⋮ Graphs with large clique-chromatic numbers ⋮ Lower bounds on the clique-chromatic numbers of some distance graphs ⋮ A linear-time algorithm for clique-coloring planar graphs ⋮ The clique-perfectness and clique-coloring of outer-planar graphs

Cites Work

• Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs
• Coloring the Maximal Cliques of Graphs
• On the complexity of bicoloring clique hypergraphs of graphs

This page was built for publication: Clique-Coloring Circular-Arc Graphs