On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2022.08.006
+Normal rank
@@ Property / OpenAlex ID @@
+W4292381379
@@ Property / OpenAlex ID: W4292381379 / rank @@
+Normal rank
@@ 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 @@
+On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph
+Normal rank
@@ Property / cites work @@
+Q5377222
@@ Property / cites work: Q5377222 / rank @@
+Normal rank
@@ Property / cites work @@
+Partitions of graphs into one or two independent sets and cliques
+Normal rank
@@ Property / cites work @@
+Q4693382
@@ Property / cites work: Q4693382 / rank @@
+Normal rank
@@ Property / cites work @@
+Probe Ptolemaic Graphs
@@ Property / cites work: Probe Ptolemaic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition of Probe Cographs and Partitioned Probe Distance Hereditary Graphs
+Normal rank
@@ Property / cites work @@
+On probe permutation graphs
@@ Property / cites work: On probe permutation graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3139761
@@ Property / cites work: Q3139761 / rank @@
+Normal rank
@@ Property / cites work @@
+The \((k,\ell)\) \textsc{unpartitioned probe} problem NP-complete versus polynomial dichotomy
+Normal rank
@@ Property / cites work @@
+Partitioning cographs into cliques and stable sets
+Normal rank
@@ Property / cites work @@
+List matrix partitions of chordal graphs
@@ Property / cites work: List matrix partitions of chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+List Partitions
@@ Property / cites work: List Partitions / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
+Normal rank
@@ Property / cites work @@
+A characterization of well covered graphs of girth 5 or greater
+Normal rank
@@ Property / cites work @@
+Graph Sandwich Problems
@@ Property / cites work: Graph Sandwich Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Chordal probe graphs
@@ Property / cites work: Chordal probe graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of chain probe graphs
@@ Property / cites work: A characterization of chain probe graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing well covered graphs of families with special \(P _{4}\)-components
+Normal rank
@@ Property / cites work @@
+Two characterizations of chain partitioned probe graphs
+Normal rank
@@ Property / cites work @@
+On probe interval graphs
@@ Property / cites work: On probe interval graphs / rank @@
+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 simplicial, chordal, and circular arc graphs
+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 @@
+Q3351385
@@ Property / cites work: Q3351385 / rank @@
+Normal rank