On coloring a class of claw-free and hole-twin-free graphs (Q2091797): Difference between revisions

@@ Property / cites work @@
+Characterizations of derived graphs
@@ Property / cites work: Characterizations of derived graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Topics on perfect graphs
@@ Property / cites work: Topics on perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Three-coloring and list three-coloring of graphs without induced paths on seven vertices
+Normal rank
@@ Property / cites work @@
+Clique-width for 4-vertex forbidden subgraphs
@@ Property / cites work: Clique-width for 4-vertex forbidden subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Three complexity results on coloring \(P_k\)-free graphs
+Normal rank
@@ Property / cites work @@
+The class of (P7,C4,C5)‐free graphs: Decomposition, algorithms, and χ‐boundedness
+Normal rank
@@ Property / cites work @@
+Recognizing Berge graphs
@@ Property / cites work: Recognizing Berge graphs / 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 @@
+Recognizing claw-free perfect graphs
@@ Property / cites work: Recognizing claw-free perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Handle-rewriting hypergraph grammars
@@ Property / cites work: Handle-rewriting hypergraph grammars / rank @@
+Normal rank
@@ Property / cites work @@
+On coloring a class of claw-free graphs.
@@ Property / cites work: On coloring a class of claw-free graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3216686
@@ Property / cites work: Q3216686 / rank @@
+Normal rank
@@ Property / cites work @@
+A coloring algorithm for \(4 K_1\)-free line graphs
+Normal rank
@@ Property / cites work @@
+Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+How To Color Claw-Free Perfect Graphs
@@ Property / cites work: How To Color Claw-Free Perfect Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved complexity results on \(k\)-coloring \(P_t\)-free graphs
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448764
@@ Property / cites work: Q4448764 / rank @@
+Normal rank
@@ Property / cites work @@
+The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
+Normal rank
@@ Property / cites work @@
+MSOL partitioning problems on graphs of bounded treewidth and clique-width
+Normal rank
@@ Property / cites work @@
+Decomposition by clique separators
@@ Property / cites work: Decomposition by clique separators / rank @@
+Normal rank
@@ Property / cites work @@
+Q3686753
@@ Property / cites work: Q3686753 / rank @@
+Normal rank