Drawing cubic graphs with at most five slopes (Q2483558): Difference between revisions
From MaRDI portal
Latest revision as of 21:27, 27 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Drawing cubic graphs with at most five slopes |
scientific article |
Statements
Drawing cubic graphs with at most five slopes (English)
0 references
28 April 2008
0 references
In the paper it is proved that every graph with maximum degree 3 has a straight-line drawing in the plane using edges of at most five different slopes. Moreover, if every component has at least one vertex of degree less than 3, then four directions suffice.
0 references
Straight-line drawing
0 references
slope number
0 references
maximum degree
0 references
enumeration
0 references
