scientific article
From MaRDI portal
Publication:3575455
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
claw-free graphcubic graphpolynomial-time algorithmclique coloringclique-transversal setweak coloring
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (17)
Clique-coloring of \(K_{3,3}\)-minor free graphs ⋮ Structural parameterizations of clique coloring ⋮ Clique-coloring claw-free graphs ⋮ The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs ⋮ Equitable clique-coloring in claw-free graphs with maximum degree at most 4 ⋮ Coloring the cliques of line graphs ⋮ Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs ⋮ Clique-transversal sets and clique-coloring in planar graphs ⋮ On the clique-transversal number in \({(\mathrm{claw},K_4)}\)-free 4-regular 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 ⋮ Unnamed Item ⋮ 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
This page was built for publication:
