Clique-coloring of \(K_{3,3}\)-minor free graphs

DOI10.1007/s41980-019-00341-0zbMath1451.05085arXiv1801.02186OpenAlexW2996395679MaRDI QIDQ826557

Maryam Taleb, Behnaz Omoomi

Publication date: 5 January 2021

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.02186

zbMATH Keywords

claw-free graphsclique-coloringclique chromatic number\(K_{3,3}\)-minor

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\)
• Clique-transversal sets of line graphs and complements of line graphs
• Claw-free graphs. IV: Decomposition theorem
• Two-colouring all two-element maximal antichains
• The Grötzsch theorem for the hypergraph of maximal cliques
• Clique-transversal sets and clique-coloring in planar graphs
• Clique-coloring claw-free graphs
• Über eine Eigenschaft der ebenen Komplexe
• Complexity of clique-coloring odd-hole-free graphs
• Coloring the Maximal Cliques of Graphs
• On the complexity of bicoloring clique hypergraphs of graphs
• Characterizations of derived graphs
• Sur le coloriage des graphs

This page was built for publication: Clique-coloring of \(K_{3,3}\)-minor free graphs