We show that every graph G with maximum degree three has a straight-line drawing in the plane using edges of at most five different slopes. Moreover, if G is connected and has at least one vertex of degree less than three, then four directions suffice
We settle a problem of Dujmovic, Eppstein, Suderman, and Wood by showing that there exists a functio...
We settle a problem of Dujmovic, Eppstein, Suderman, and Wood by showing that there exists a functio...
We settle a problem of Dujmovi¢, Eppstein, Suderman, and Wood by showing that there exists a functio...
AbstractWe show that every graph G with maximum degree three has a straight-line drawing in the plan...
Abstract. We show that every graph G with maximum degree three has a straight-line drawing in the pl...
AbstractWe show that every connected cubic graph can be drawn in the plane with straight-line edges ...
We show that every cubic graph can be drawn in the plane with straight-line edges using only the fou...
We show that every finite connected graph G with maximum degree three and with at least one vertex of...
We show that every connected cubic graph can be can be drawn in the plane with straight line edges u...
We show that every nite connected graph G with maximum degree three and with at least one vertex of ...
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obta...
Abstract. We study straight-line drawings of graphs with few segments and few slopes. Optimal result...
We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results a...
AbstractWe study straight-line drawings of planar graphs with few segments and few slopes. Optimal r...
We settle a problem of Dujmovic, Eppstein, Suderman, and Wood by showing that there exists a functio...
We settle a problem of Dujmovic, Eppstein, Suderman, and Wood by showing that there exists a functio...
We settle a problem of Dujmovic, Eppstein, Suderman, and Wood by showing that there exists a functio...
We settle a problem of Dujmovi¢, Eppstein, Suderman, and Wood by showing that there exists a functio...
AbstractWe show that every graph G with maximum degree three has a straight-line drawing in the plan...
Abstract. We show that every graph G with maximum degree three has a straight-line drawing in the pl...
AbstractWe show that every connected cubic graph can be drawn in the plane with straight-line edges ...
We show that every cubic graph can be drawn in the plane with straight-line edges using only the fou...
We show that every finite connected graph G with maximum degree three and with at least one vertex of...
We show that every connected cubic graph can be can be drawn in the plane with straight line edges u...
We show that every nite connected graph G with maximum degree three and with at least one vertex of ...
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obta...
Abstract. We study straight-line drawings of graphs with few segments and few slopes. Optimal result...
We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results a...
AbstractWe study straight-line drawings of planar graphs with few segments and few slopes. Optimal r...
We settle a problem of Dujmovic, Eppstein, Suderman, and Wood by showing that there exists a functio...
We settle a problem of Dujmovic, Eppstein, Suderman, and Wood by showing that there exists a functio...
We settle a problem of Dujmovic, Eppstein, Suderman, and Wood by showing that there exists a functio...
We settle a problem of Dujmovi¢, Eppstein, Suderman, and Wood by showing that there exists a functio...
DOI
Add to ORKG