Determining outerplanarity using segment graphs

DOI10.1080/03081088308817532zbMath0514.05030OpenAlexW2061902336MaRDI QIDQ3659805

Kiem-Phong Vo

Publication date: 1983

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081088308817532

zbMATH Keywords

segment graphsdepth first searchtesting outerplanarity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (3)

Ranking and unranking planar embeddings ⋮ A matrix analysis of carrier posets of biconnected graphs ⋮ Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs

Cites Work

• Unnamed Item
• Embedding Graphs in the Plane—Algorithmic Aspects
• Efficient Planarity Testing

This page was built for publication: Determining outerplanarity using segment graphs