Publication:3575455
From MaRDI portal
zbMath1196.05029MaRDI QIDQ3575455
Publication date: 27 July 2010
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1273/0.html
claw-free graph; cubic graph; polynomial-time algorithm; clique coloring; clique-transversal set; weak coloring
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Unnamed Item, The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs, The clique-transversal set problem in claw-free graphs with degree at most 4, Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\), A linear-time algorithm for clique-coloring problem in circular-arc graphs, Claw-free cubic graphs with clique-transversal number half of their order, Clique-coloring of \(K_{3,3}\)-minor free graphs, Structural parameterizations of clique coloring, Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs, On the complexity of local-equitable coloring of graphs, A generalization of Grötzsch Theorem on the local-equitable coloring, The clique-perfectness and clique-coloring of outer-planar graphs, Coloring the cliques of line graphs, Clique-transversal sets and clique-coloring in planar graphs, On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular graphs, Clique-coloring claw-free graphs, Equitable clique-coloring in claw-free graphs with maximum degree at most 4
