Colouring a dominating set without conflicts: \(q\)-subset square colouring
From MaRDI portal
Publication:6077071
DOI10.1016/j.tcs.2023.114160arXiv2303.06864MaRDI QIDQ6077071
V. P. Abidha, Pradeesha Ashok, Dolly Yadav, Avi Tomar
Publication date: 17 October 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2303.06864
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of conflict-free colorings of graphs
- Parameterized complexity of coloring problems: treewidth versus vertex cover
- Maximal independent sets in caterpillar graphs
- Dominating sets for split and bipartite graphs
- Bipartite permutation graphs
- Weighted efficient domination problem on some perfect graphs
- Algorithmic graph theory and perfect graphs
- An optimal square coloring of planar graphs
- Coloring a dominating set without conflicts: \(q\)-subset square coloring
- Structural parameterization for minimum conflict-free colouring
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- Parameterized Algorithms for Modular-Width
- Hardness of r-dominating set on Graphs of Diameter (r + 1)
- On the Harmonious Coloring of Graphs
- Labelling Graphs with a Condition at Distance 2
- Conflict-Free Coloring of Graphs
- Coloring the square of a planar graph
- Domination numbers of planar graphs
- Parameterized Complexity of Conflict-Free Graph Coloring
- Kernelization Lower Bounds by Cross-Composition
- Chromatic Graph Theory
- Parameterized Algorithms
This page was built for publication: Colouring a dominating set without conflicts: \(q\)-subset square colouring
