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

@@ Property / author @@
-Ju-Yuan Hsiao
@@ Property / author: Ju-Yuan Hsiao / rank @@
-Normal rank
@@ Property / author @@
-Ruay-Shiung Chang
@@ Property / author: Ruay-Shiung Chang / rank @@
-Normal rank
@@ Property / author @@
+Ju-Yuan Hsiao
@@ Property / author: Ju-Yuan Hsiao / rank @@
+Normal rank
@@ Property / author @@
+Ruay-Shiung Chang
@@ Property / author: Ruay-Shiung Chang / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ 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
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(91)90124-z
+Normal rank
@@ Property / OpenAlex ID @@
+W1979977220
@@ Property / OpenAlex ID: W1979977220 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1183488