Structural parameterizations of clique coloring
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7559420
- Complexity of clique coloring and related problems
- Cliques, colouring and satisfiability: from structure to algorithms
- Clique-relaxed graph coloring
- Coloring the Maximal Cliques of Graphs
- Clique colourings of geometric graphs
- Analogues of cliques for oriented coloring
- Exact algorithms to clique-colour graphs
- Structural parameterization for minimum conflict-free colouring
- Structural parameterizations of budgeted graph coloring
Cites work
- scientific article; zbMATH DE number 487720 (Why is no real title available?)
- scientific article; zbMATH DE number 7559420 (Why is no real title available?)
- Clique-coloring circular-arc graphs
- Clique-coloring some classes of odd-hole-free graphs
- Clique-transversal sets and clique-coloring in planar 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
- Clique-width of graphs defined by one-vertex extensions
- Clique-width. III: Hamiltonian cycle and the odd case of graph coloring
- Coloring the Maximal Cliques of Graphs
- Colouring clique-hypergraphs of circulant graphs
- Complexity of clique coloring and related problems
- Decomposing and clique-coloring (diamond, odd-hole)-free graphs
- Exact algorithms to clique-colour graphs
- Fine-grained parameterized complexity analysis of graph coloring problems
- Fourier meets M\"{o}bius: fast subset convolution
- Fundamentals of parameterized complexity
- Graph theory
- Handle-rewriting hypergraph grammars
- Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
- Intractability of clique-width parameterizations
- Known algorithms on graphs of bounded treewidth are probably optimal
- On problems as hard as CNF-SAT
- On the complexity of \(k\)-SAT
- On the complexity of bicoloring clique hypergraphs of graphs
- Parameterized algorithms
- Perfect graphs of arbitrarily large clique-chromatic number
- Perfect graphs with no balanced skew-partition are 2-clique-colorable
- The Grötzsch theorem for the hypergraph of maximal cliques
- Treewidth. Computations and approximations
- Two-colouring all two-element maximal antichains
- Upper bounds to the clique width of graphs
- Which problems have strongly exponential complexity?
Cited in
(6)- Structural parameterization for minimum conflict-free colouring
- scientific article; zbMATH DE number 939919 (Why is no real title available?)
- Clique-relaxed graph coloring
- Forcing structures and cliques in uniquely vertex colorable graphs
- scientific article; zbMATH DE number 7559420 (Why is no real title available?)
- Exact algorithms to clique-colour graphs
This page was built for publication: Structural parameterizations of clique coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832512)
