Algorithms on clique separable graphs (Q1246434): Difference between revisions

@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5341588
@@ Property / cites work: Q5341588 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank
@@ Property / cites work @@
+Transitive Orientation of Graphs and Identification of                         Permutation Graphs
+Normal rank
@@ Property / cites work @@
+Triangulated graphs and the elimination process
@@ Property / cites work: Triangulated graphs and the elimination process / rank @@
+Normal rank
@@ Property / cites work @@
+Q5554163
@@ Property / cites work: Q5554163 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0012-365x(77)90030-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2013949481
@@ Property / OpenAlex ID: W2013949481 / rank @@
+Normal rank