Coloring a dominating set without conflicts: \(q\)-subset square coloring

DOI10.1007/978-3-031-09574-0_2OpenAlexW4285129421MaRDI QIDQ2097209

Pradeesha Ashok, V. P. Abidha, Avi Tomar, Dolly Yadav

Publication date: 11 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-09574-0_2

zbMATH Keywords

graph coloringdominating setparameterized algorithmsquare coloringsubset square coloring

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Colouring a dominating set without conflicts: \(q\)-subset square colouring

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of conflict-free colorings of graphs
• Maximal independent sets in caterpillar graphs
• Dominating sets for split and bipartite graphs
• Bipartite permutation graphs
• Algorithmic graph theory and perfect graphs
• An optimal square coloring of planar graphs
• 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
• Coloring the square of a planar graph
• Domination numbers of planar graphs
• Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
• Chromatic Graph Theory
• Parameterized Algorithms

This page was built for publication: Coloring a dominating set without conflicts: \(q\)-subset square coloring