Solving the single step graph searching problem by solving the maximum two-independent set problem (Q1183488): Difference between revisions

@@ Property / cites work @@
+Trapezoid graphs and their coloring
@@ Property / cites work: Trapezoid graphs and their coloring / rank @@
+Normal rank
@@ Property / cites work @@
+On chain and antichain families of a partially ordered set
+Normal rank
@@ Property / cites work @@
+The edge inducibility of graphs
@@ Property / cites work: The edge inducibility of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138888
@@ Property / cites work: Q3138888 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4159394
@@ Property / cites work: Q4159394 / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum k-colorable subgraph problem for chordal graphs
+Normal rank