scientific article; zbMATH DE number 7559420
From MaRDI portal
Publication:5089217
DOI10.4230/LIPICS.MFCS.2020.49MaRDI QIDQ5089217FDOQ5089217
Authors: Lars Jaffke, Geevarghese Philip, Paloma T. Lima 
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2005.04733
Title of this publication is not available (Why is that?)
Recommendations
- Structural parameterizations of clique coloring
- 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
- Graph theory
- Fundamentals of parameterized complexity
- Which problems have strongly exponential complexity?
- Upper bounds to the clique width of graphs
- Perfect graphs with no balanced skew-partition are 2-clique-colorable
- On problems as hard as CNF-SAT
- Parameterized algorithms
- On the complexity of \(k\)-SAT
- Perfect graphs of arbitrarily large clique-chromatic number
- Title not available (Why is that?)
- Intractability of clique-width parameterizations
- Fourier meets M\"{o}bius: fast subset convolution
- Exact algorithms to clique-colour graphs
- Complexity of clique coloring and related problems
- 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
- The Grötzsch theorem for the hypergraph of maximal cliques
- Coloring the Maximal Cliques of Graphs
- Colouring clique-hypergraphs of circulant graphs
- On the complexity of bicoloring clique hypergraphs of graphs
- Two-colouring all two-element maximal antichains
- Clique-coloring some classes of odd-hole-free graphs
- Clique-width of graphs defined by one-vertex extensions
- Clique-coloring circular-arc graphs
- 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)
- Clique-width. III: Hamiltonian cycle and the odd case of graph coloring
- Fine-grained parameterized complexity analysis of graph coloring problems
Cited In (9)
- Structure Learning of $H$-colorings
- Structural Parameterizations of Clique Coloring
- \(b\)-coloring parameterized by clique-width
- Title not available (Why is that?)
- Clique-relaxed graph coloring
- Forcing structures and cliques in uniquely vertex colorable graphs
- Exact algorithms to clique-colour graphs
- Structural parameterizations of clique coloring
- Structural parameterization for minimum conflict-free colouring
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089217)
