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

DOI10.1007/978-3-031-09574-0_2MaRDI QIDQ2097209zbMATH OpenOpenAlexFDO

Authors V. P. Abidha, Pradeesha Ashok, 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

dominating setgraph coloringparameterized algorithmsquare coloringsubset square coloring

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A c^k n 5-approximation algorithm for treewidth
• Algorithmic graph theory and perfect graphs
• An optimal square coloring of planar graphs
• Bipartite permutation graphs
• Chromatic graph theory
• Coloring the square of a planar graph
• Complexity of conflict-free colorings of graphs
• Dominating sets for split and bipartite graphs
• Domination numbers of planar graphs
• Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
• Hardness of r-dominating set on graphs of diameter (r + 1)
• scientific article; zbMATH DE number 6515825 (Why is no real title available?)
• scientific article; zbMATH DE number 4085682 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Labelling Graphs with a Condition at Distance 2
• Maximal independent sets in caterpillar graphs
• On the Harmonious Coloring of Graphs
• Parameterized algorithms
• Parameterized Algorithms for Modular-Width

Cited in

(1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097209)