Parameterized Complexity of Conflict-Free Graph Coloring
From MaRDI portal
Publication:4959657
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Complexity of conflict-free colorings of graphs
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Conflict-free coloring and its applications
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
- Conflict-free coloring of graphs
- Conflict-free coloring of points and simple regions in the plane
- Conflict-free colouring of graphs
- Conflict-free colourings of graphs and hypergraphs
- Data reduction for graph coloring problems
- Exact exponential algorithms.
- Kernel bounds for disjoint cycles and disjoint paths
- Kernelization Lower Bounds by Cross-Composition
- Known algorithms on graphs of bounded treewidth are probably optimal
- On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat}
- Optimal data reduction for graph coloring using low-degree polynomials
- Optimal sparsification for some binary CSPs using low-degree polynomials
- Parameterized algorithms
- The complexity of satisfiability problems
Cited in
(8)- Conflict-free coloring bounds on open neighborhoods
- Structural parameterization for minimum conflict-free colouring
- Parameterized complexity of conflict-free matchings and paths
- Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs
- Parameterized complexity of the list coloring reconfiguration problem with graph parameters
- Colouring a dominating set without conflicts: \(q\)-subset square colouring
- On odd colorings of planar graphs
- Minimum conflict free colouring parameterized by treewidth
This page was built for publication: Parameterized Complexity of Conflict-Free Graph Coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959657)
