Colouring a dominating set without conflicts: $q$-subset square colouring (Q6077071): Difference between revisions

@@ Property / cites work @@
+Conflict-Free Coloring of Graphs
@@ Property / cites work: Conflict-Free Coloring of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring a dominating set without conflicts: \(q\)-subset square coloring
+Normal rank
@@ Property / cites work @@
+Structural parameterization for minimum conflict-free colouring
+Normal rank
@@ Property / cites work @@
+Q3815323
@@ Property / cites work: Q3815323 / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating sets for split and bipartite graphs
@@ Property / cites work: Dominating sets for split and bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A $c^k n$ 5-Approximation Algorithm for Treewidth
@@ Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Kernelization Lower Bounds by Cross-Composition
@@ Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of Conflict-Free Graph Coloring
+Normal rank
@@ Property / cites work @@
+An optimal square coloring of planar graphs
@@ Property / cites work: An optimal square coloring of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Weighted efficient domination problem on some perfect graphs
+Normal rank
@@ Property / cites work @@
+Chromatic Graph Theory
@@ Property / cites work: Chromatic Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263467
@@ Property / cites work: Q4263467 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of coloring problems: treewidth versus vertex cover
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms for Modular-Width
@@ Property / cites work: Parameterized Algorithms for Modular-Width / rank @@
+Normal rank
@@ Property / cites work @@
+Q3455032
@@ Property / cites work: Q3455032 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of conflict-free colorings of graphs
@@ Property / cites work: Complexity of conflict-free colorings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Labelling Graphs with a Condition at Distance 2
@@ Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring the square of a planar graph
@@ Property / cites work: Coloring the square of a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+On the Harmonious Coloring of Graphs
@@ Property / cites work: On the Harmonious Coloring of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness of r-dominating set on Graphs of Diameter (r + 1)
+Normal rank
@@ Property / cites work @@
+Domination numbers of planar graphs
@@ Property / cites work: Domination numbers of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal independent sets in caterpillar graphs
@@ Property / cites work: Maximal independent sets in caterpillar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bipartite permutation graphs
@@ Property / cites work: Bipartite permutation graphs / rank @@
+Normal rank

Colouring a dominating set without conflicts: \(q\)-subset square colouring (Q6077071): Difference between revisions

Latest revision as of 05:24, 3 August 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)