Linear algorithms to recognize outerplanar and maximal outerplanar graphs (Q1144938): Difference between revisions

@@ Property / author @@
-Sandra M. Hedetniemi
@@ Property / author: Sandra M. Hedetniemi / rank @@
-Normal rank
@@ Property / author @@
+Sandra M. Hedetniemi
@@ Property / author: Sandra M. Hedetniemi / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(79)90075-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2093092867
@@ Property / OpenAlex ID: W2093092867 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4190666
@@ Property / cites work: Q4190666 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for testing chordality of graphs
@@ Property / cites work: An algorithm for testing chordality of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1144938