Linear algorithms to recognize outerplanar and maximal outerplanar graphs (Q1144938): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4190666 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An algorithm for testing chordality of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient Planarity Testing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G / rank | |||
Normal rank |
Latest revision as of 09:28, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Linear algorithms to recognize outerplanar and maximal outerplanar graphs |
scientific article |
Statements
Linear algorithms to recognize outerplanar and maximal outerplanar graphs (English)
0 references
1979
0 references
linear algorithms
0 references
outerplanar graphs
0 references
graph recognition
0 references
biconnected graphs
0 references
triangulation
0 references