Skip Navigation

The Computer Journal 1994 37(2):139-142; doi:10.1093/comjnl/37.2.139
© 1994 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (5)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Wade, G. A.
Right arrow Articles by Chu, J.-H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Drawability of Complete Graphs Using a Minimal Slope Set

G. A. Wade and J.-H. Chu *

Department of Computer Science, Southern Illinois University, Carbondale, IL 62901, USA

In this paper we will study the problem of drawing graphs with a minimum number of slopes. We will show that the minimum number of slopes needed to draw a complete graph of n vertices is n. We will also prove that for a complete graph of n vertices to be drawn using only n slopes its vertices must form a convex polygon. Finally, we will present an algorithm which checks whether a complete graph of n vertices can be drawn using only slopes from a given set of n slopes.

Received July 2, 1993. revised November 9, 1993.

* Correspondence to J.-H. Chu.

§ Department of Computer Science, Southern Illinois University, Carbondale, IL 62901, USA


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.