Clique-coloring some classes of odd-hole-free graphs
From MaRDI portal
Publication:3419713
DOI10.1002/jgt.20177zbMath1108.05036OpenAlexW4251857585MaRDI QIDQ3419713
Publication date: 7 February 2007
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20177
Related Items (23)
Structural parameterizations of clique coloring ⋮ Clique-coloring claw-free graphs ⋮ Equitable clique-coloring in claw-free graphs with maximum degree at most 4 ⋮ More Results on Clique-chromatic Numbers of Graphs with No Long Path ⋮ New bounds on clique-chromatic numbers of Johnson graphs ⋮ Perfect graphs of arbitrarily large clique-chromatic number ⋮ Clique-transversal sets and clique-coloring in planar graphs ⋮ Clique colourings of geometric graphs ⋮ Subgraph-avoiding coloring of graphs ⋮ Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) ⋮ A linear-time algorithm for clique-coloring problem in circular-arc graphs ⋮ Complexity of clique coloring and related problems ⋮ Unnamed Item ⋮ Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable ⋮ Lower bounds on the clique-chromatic numbers of some distance graphs ⋮ A linear-time algorithm for clique-coloring planar graphs ⋮ List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly ⋮ Clique chromatic numbers of intersection graphs ⋮ Colouring clique-hypergraphs of circulant graphs ⋮ Complexity of clique-coloring odd-hole-free graphs ⋮ On the complexity of local-equitable coloring of graphs ⋮ The clique-perfectness and clique-coloring of outer-planar graphs ⋮ A generalization of Grötzsch Theorem on the local-equitable coloring
Cites Work
This page was built for publication: Clique-coloring some classes of odd-hole-free graphs
