A Simple Criterion for Nodal 3-connectivity in Planar Graphs

DOI10.1016/j.entcs.2008.12.078zbMath1336.05034OpenAlexW2109819215MaRDI QIDQ4982066

No author found.

Publication date: 23 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.078

zbMATH Keywords

planar graphnodally 3-connected

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Graph algorithms (graph-theoretic aspects) (05C85) Convex sets in (2) dimensions (including convex curves) (52A10) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to draw a planar graph on a grid
• Convex Representations of Graphs
• One-to-one piecewise linear mappings over triangulations
• How to Draw a Graph

This page was built for publication: A Simple Criterion for Nodal 3-connectivity in Planar Graphs