A new characterization of \(P_k\)-free graphs (Q300476): Difference between revisions

@@ Property / cites work @@
+Dominating cliques in \(P_ 5\)-free graphs
@@ Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Three complexity results on coloring \(P_k\)-free graphs
+Normal rank
@@ Property / cites work @@
+The price of connectivity for dominating set: upper bounds and complexity
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating cliques in graphs
@@ Property / cites work: Dominating cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+Improved Complexity Results on k-Coloring P t -Free Graphs
+Normal rank
@@ Property / cites work @@
+Characterization of \(P_{6}\)-free graphs
@@ Property / cites work: Characterization of \(P_{6}\)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating subgraphs in graphs with some forbidden structures
+Normal rank
@@ Property / cites work @@
+Independent Set in <i>P</i><sub>5</sub>-Free Graphs in Polynomial Time
+Normal rank
@@ Property / cites work @@
+-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
+Normal rank
@@ Property / cites work @@
+A New Characterization of P 6-Free Graphs
@@ Property / cites work: A New Characterization of P 6-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A new characterization of \(P_{6}\)-free graphs
@@ Property / cites work: A new characterization of \(P_{6}\)-free graphs / rank @@
+Normal rank