Finding large holes (Q1182105): Difference between revisions

@@ Property / author @@
-Jeremy P. Spinrad
@@ Property / author: Jeremy P. Spinrad / rank @@
-Normal rank
@@ Property / author @@
+Jeremy P. Spinrad
@@ Property / author: Jeremy P. Spinrad / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Topics on perfect graphs
@@ Property / cites work: Topics on perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+`` Strong '' NP-Completeness Results
@@ Property / cites work: `` Strong '' NP-Completeness Results / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Weakly triangulated graphs
@@ Property / cites work: Weakly triangulated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on odd/even cycles
@@ Property / cites work: A note on odd/even cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+On Comparability and Permutation Graphs
@@ Property / cites work: On Comparability and Permutation Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for weakly triangulated graphs
@@ Property / cites work: Algorithms for weakly triangulated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(91)90184-j
+Normal rank
@@ Property / OpenAlex ID @@
+W2062596745
@@ Property / OpenAlex ID: W2062596745 / rank @@
+Normal rank