On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs

DOI10.1007/978-3-642-03409-1_14zbMath1252.68211arXiv0905.3812OpenAlexW3125618301MaRDI QIDQ3183604

Koushik Sinha, Subhas Kumar Ghosh

Publication date: 20 October 2009

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.3812

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 (2)

Succinct greedy drawings do not always exist ⋮ On succinct greedy drawings of plane triangulations and 3-connected plane graphs

This page was built for publication: On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs