Colouring Some Classes of Perfect Graphs Robustly (Q3439399): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2005.06.083
+Normal rank
@@ Property / OpenAlex ID @@
+W2066202945
@@ Property / OpenAlex ID: W2066202945 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4172077
@@ Property / cites work: Q4172077 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3344031
@@ Property / cites work: Q3344031 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3348434
@@ Property / cites work: Q3348434 / rank @@
+Normal rank
@@ Property / cites work @@
+On a conjecture of Meyniel
@@ Property / cites work: On a conjecture of Meyniel / 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 @@
+Q3140413
@@ Property / cites work: Q3140413 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms on circular-arc graphs
@@ Property / cites work: Algorithms on circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3216686
@@ Property / cites work: Q3216686 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast algorithm for coloring Meyniel graphs
@@ Property / cites work: A fast algorithm for coloring Meyniel graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time recognition of circular-arc graphs
@@ Property / cites work: Linear-time recognition of circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3682511
@@ Property / cites work: Q3682511 / rank @@
+Normal rank
@@ Property / cites work @@
+An \(O(n^2)\) algorithm to color Meyniel graphs
@@ Property / cites work: An \(O(n^2)\) algorithm to color Meyniel graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient graph representations
@@ Property / cites work: Efficient graph representations / rank @@
+Normal rank