3-colouring for dually chordal graphs and generalisations (Q2404614): Difference between revisions

@@ Property / cites work @@
+On bridged graphs and cop-win graphs
@@ Property / cites work: On bridged graphs and cop-win graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Dismantling absolute retracts of reflexive graphs
@@ Property / cites work: Dismantling absolute retracts of reflexive graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The algorithmic use of hypertree structure and maximum neighbourhood orderings
+Normal rank
@@ Property / cites work @@
+Dually Chordal Graphs
@@ Property / cites work: Dually Chordal 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 @@
+An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
+Normal rank
@@ Property / cites work @@
+On the Complexity of Computing Treebreadth
@@ Property / cites work: On the Complexity of Computing Treebreadth / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4426355
@@ Property / cites work: Q4426355 / rank @@
+Normal rank