Structural parameterizations of clique coloring
From MaRDI portal
Publication:832512
DOI10.1007/s00453-021-00890-zOpenAlexW3216196636MaRDI QIDQ832512
Lars Jaffke, Paloma T. Lima, Geevarghese Philip
Publication date: 25 March 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-021-00890-z
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Complexity of clique coloring and related problems
- Clique-transversal sets of line graphs and complements of line graphs
- Perfect graphs of arbitrarily large clique-chromatic number
- Clique-width of graphs defined by one-vertex extensions
- Two-colouring all two-element maximal antichains
- The Grötzsch theorem for the hypergraph of maximal cliques
- Treewidth. Computations and approximations
- Which problems have strongly exponential complexity?
- Upper bounds to the clique width of graphs
- Handle-rewriting hypergraph grammars
- Clique-transversal sets and clique-coloring in planar graphs
- Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable
- Clique-Coloring Circular-Arc Graphs
- Exact Algorithms to Clique-Colour Graphs
- Intractability of Clique-Width Parameterizations
- Clique-coloring some classes of odd-hole-free graphs
- Fourier meets M\"{o}bius: fast subset convolution
- Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal
- Clique-width III
- Coloring the Maximal Cliques of Graphs
- On the complexity of bicoloring clique hypergraphs of graphs
- On Problems as Hard as CNF-SAT
- Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems
- Decomposing and Clique‐Coloring (Diamond, Odd‐Hole)‐Free Graphs
- Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
- Parameterized Algorithms
- Colouring clique-hypergraphs of circulant graphs
- On the complexity of \(k\)-SAT
This page was built for publication: Structural parameterizations of clique coloring
