Clique-transversal sets and clique-coloring in planar graphs
From MaRDI portal
(Redirected from Publication:2441644)
Recommendations
- scientific article; zbMATH DE number 6612570
- The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs
- Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
- scientific article; zbMATH DE number 45166
- Clique-Transversal Sets in Cubic Graphs
- Clique-transversal sets of line graphs and complements of line graphs
- Clique-transversal sets in line graphs of cubic graphs and triangle-free graphs
- The clique-perfectness and clique-coloring of outer-planar graphs
- On clique-transversals and clique-independent sets
- Clique covers and coloring problems of graphs
Cites work
- 2-list-coloring planar graphs without monochromatic triangles
- Algorithmic aspects of clique-transversal and clique-independent sets
- Algorithmic Aspects of Neighborhood Numbers
- Bounds on the clique-transversal number of regular graphs
- Chains, antichains, and fibres
- Clique-coloring some classes of odd-hole-free graphs
- Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
- Clique-transversal sets of line graphs and complements of line graphs
- Coloring the Maximal Cliques of Graphs
- Complexity of clique coloring and related problems
- Complexity of clique-coloring odd-hole-free graphs
- Covering all cliques of a graph
- Covering the cliques of a graph with vertices
- Distance-hereditary graphs are clique-perfect
- Extending matchings in claw-free graphs
- Fibres and ordered set coloring
- Graph theory
- scientific article; zbMATH DE number 3522018 (Why is no real title available?)
- scientific article; zbMATH DE number 790475 (Why is no real title available?)
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- On clique-transversals and clique-independent sets
- On covering all cliques of a chordal graph
- On the clique-transversal number of chordal graphs
- On the complexity of bicoloring clique hypergraphs of graphs
- On the divisibility of graphs
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- The \(\langle t \rangle \)-property of some classes of graphs
- The Grötzsch theorem for the hypergraph of maximal cliques
Cited in
(24)- On the complexity of local-equitable coloring of graphs
- A generalization of Grötzsch Theorem on the local-equitable coloring
- Total coloring of claw-free planar graphs
- A linear-time algorithm for clique-coloring planar graphs
- List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly
- The clique-perfectness and clique-coloring of outer-planar graphs
- Clique-coloring claw-free graphs
- Equitable clique-coloring in claw-free graphs with maximum degree at most 4
- scientific article; zbMATH DE number 6612570 (Why is no real title available?)
- The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs
- Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
- Clique-Transversal Sets in Cubic Graphs
- scientific article; zbMATH DE number 45166 (Why is no real title available?)
- Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\)
- scientific article; zbMATH DE number 7559420 (Why is no real title available?)
- A linear-time algorithm for clique-coloring problem in circular-arc graphs
- Inapproximability of \(H\)-transversal/packing
- Upper Clique Transversals in Graphs
- Clique colourings of geometric graphs
- The clique chromatic number of sparse random graphs
- Conformality of minimal transversals of maximal cliques
- Conformal hypergraphs: duality and implications for the upper clique transversal problem
- Clique-coloring of \(K_{3,3}\)-minor free graphs
- Structural parameterizations of clique coloring
This page was built for publication: Clique-transversal sets and clique-coloring in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2441644)
