Drawing cubic graphs with at most five slopes (Q2483558)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5268583
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Drawing cubic graphs with at most five slopes |
scientific article; zbMATH DE number 5268583 |
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
0 references
0.9140451
0 references
0 references
0.84719115
0 references
0.84480095
0 references
0.84480095
0 references
0.8424174
0 references
0.8424174
0 references
