Cubic graphs have bounded slope parameter

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We show that every finite connected graph G with maximum degree three and with at least one vertex of degree smaller than three has a straight-line drawing in the plane satisfying the following conditions. No three vertices are collinear, and a pair of vertices form an edge in G if and only if the segment connecting them is parallel to one of the sides of a previously fixed regular pentagon. It is also proved that every finite graph with maximum degree three permits a straight-line drawing with the above properties using only at most seven different edge slopes. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Keszegh, B., Pach, J., Pálvölgyi, D., & Tóth, G. (2009). Cubic graphs have bounded slope parameter. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5417 LNCS, pp. 50–60). Springer Verlag. https://doi.org/10.1007/978-3-642-00219-9_6

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