A simple recognition of maximal planar graphs

DOI10.1016/j.ipl.2003.11.011zbMath1178.68382OpenAlexW2072818354MaRDI QIDQ1029086

Takahisa Suzuki, Hiroshi Nagamochi, Toshimasa Ishii

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.11.011

zbMATH Keywords

graph algorithmslinear time algorithmmaximal planar graphplanarity testtriangulated plane graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Unnamed Item

Cites Work

• How to draw a planar graph on a grid
• Efficient Planarity Testing

This page was built for publication: A simple recognition of maximal planar graphs