Recognizing well-dominated graphs is coNP-complete (Q6072202): Difference between revisions

@@ Property / cites work @@
+Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques
+Normal rank
@@ Property / cites work @@
+Partitions and well-coveredness: the graph sandwich problem
+Normal rank
@@ Property / cites work @@
+On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
+Normal rank
@@ Property / cites work @@
+On well-dominated graphs
@@ Property / cites work: On well-dominated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5377222
@@ Property / cites work: Q5377222 / rank @@
+Normal rank
@@ Property / cites work @@
+Well-totally-dominated graphs
@@ Property / cites work: Well-totally-dominated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Domination chain: characterisation, classical complexity, parameterised complexity and approximability
+Normal rank
@@ Property / cites work @@
+The many facets of upper domination
@@ Property / cites work: The many facets of upper domination / rank @@
+Normal rank
@@ Property / cites work @@
+It is hard to know when greedy is good for finding independent sets
+Normal rank
@@ Property / cites work @@
+Well-covered circulant graphs
@@ Property / cites work: Well-covered circulant graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4693382
@@ Property / cites work: Q4693382 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing Greedy Structures
@@ Property / cites work: Recognizing Greedy Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q3139761
@@ Property / cites work: Q3139761 / rank @@
+Normal rank
@@ Property / cites work @@
+Properties of Hereditary Hypergraphs and Middle Graphs
+Normal rank
@@ Property / cites work @@
+Well-covered graphs and extendability
@@ Property / cites work: Well-covered graphs and extendability / rank @@
+Normal rank
@@ Property / cites work @@
+On the probe problem for \((r,\ell )\)-well-coveredness
+Normal rank
@@ Property / cites work @@
+On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity
+Normal rank
@@ Property / cites work @@
+Very well covered graphs
@@ Property / cites work: Very well covered graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of well covered graphs of girth 5 or greater
+Normal rank
@@ Property / cites work @@
+A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
+Normal rank
@@ Property / cites work @@
+Q3797234
@@ Property / cites work: Q3797234 / rank @@
+Normal rank
@@ Property / cites work @@
+A revision and extension of results on 4-regular, 4-connected, claw-free graphs
+Normal rank
@@ Property / cites work @@
+Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs
+Normal rank
@@ Property / cites work @@
+Q4393340
@@ Property / cites work: Q4393340 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing well covered graphs of families with special \(P _{4}\)-components
+Normal rank
@@ Property / cites work @@
+Q3340896
@@ Property / cites work: Q3340896 / rank @@
+Normal rank
@@ Property / cites work @@
+Well-dominated graphs without cycles of lengths 4 and 5
+Normal rank
@@ Property / cites work @@
+Some covering concepts in graphs
@@ Property / cites work: Some covering concepts in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+WELL-COVERED GRAPHS: A SURVEY
@@ Property / cites work: WELL-COVERED GRAPHS: A SURVEY / rank @@
+Normal rank
@@ Property / cites work @@
+Well covered simplicial, chordal, and circular arc graphs
+Normal rank
@@ Property / cites work @@
+Q4304338
@@ Property / cites work: Q4304338 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4179024
@@ Property / cites work: Q4179024 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity results for well‐covered graphs
@@ Property / cites work: Complexity results for well‐covered graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Well-covered claw-free graphs
@@ Property / cites work: Well-covered claw-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Well irredundant graphs
@@ Property / cites work: Well irredundant graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3351385
@@ Property / cites work: Q3351385 / rank @@
+Normal rank