Skip to main content
Conference ProceedingsOPEN ACCESS

Non-convex representations of graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5417 LNCS 390-395
DOI: 10.1007/978-3-642-00219-9_38
3Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We show that every plane graph admits a planar straight-line drawing in which all faces with more than three vertices are non-convex polygons. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Di Battista, G., Frati, F., & Patrignani, M. (2009). Non-convex representations of graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5417 LNCS, pp. 390–395). Springer Verlag. https://doi.org/10.1007/978-3-642-00219-9_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free