DRAWABILITY OF COMPLETE GRAPHS USING A MINIMAL SLOPE SET

Authors
WADE GA CHU JH
Citation
Ga. Wade et Jh. Chu, DRAWABILITY OF COMPLETE GRAPHS USING A MINIMAL SLOPE SET, Computer journal, 37(2), 1994, pp. 139-142
Citations number
11
Categorie Soggetti
Computer Sciences","Computer Science Hardware & Architecture
Journal title
Computer journal → ACNP
ISSN journal
00104620
Volume
37
Issue
2
Year of publication
1994
Pages
139 - 142
Database
ISI
SICI code
0010-4620(1994)37:2<139:DOCGUA>2.0.ZU;2-8
Abstract
In this paper we will study the problem of drawing graphs with a minim um number of slopes. We will show that the minimum number of slopes ne eded to draw a complete graph of n vertices is n. We will also prove t hat 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 d rawn using only slopes from a given set of n slopes.