An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs (Q3960133): Difference between revisions

@@ Property / cites work @@
+Cyclic Scheduling via Integer Programs with Circular Ones
+Normal rank
@@ Property / cites work @@
+On a routing problem
@@ Property / cites work: On a routing problem / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum node disjoint path covering for circular-arc graphs
+Normal rank
@@ Property / cites work @@
+Q4099557
@@ Property / cites work: Q4099557 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Coloring Circular Arcs and Chords
+Normal rank
@@ Property / cites work @@
+Algorithms for a maximum clique and a maximum independent set of a circle graph
+Normal rank
@@ Property / cites work @@
+Algorithms on circular-arc graphs
@@ Property / cites work: Algorithms on circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix characterizations of circular-arc graphs
@@ Property / cites work: Matrix characterizations of circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Structure theorems for some circular-arc graphs
@@ Property / cites work: Structure theorems for some circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring a Family of Circular Arcs
@@ Property / cites work: Coloring a Family of Circular Arcs / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Test for Circular-Arc Graphs
@@ Property / cites work: An Efficient Test for Circular-Arc Graphs / rank @@
+Normal rank