V.B.AlekseevandV.S.Goncakov. The thickness of an arbitrary complete graph. Math USSR Sbornik, 30(2):187--202, 1976. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Geometric Thickness of Complete Graphs - Dillencourt, Eppstein, Hirschberg (2000) (8 citations) (Correct)
....2 (called doubly linear graphs) have been studied by Hutchinson et al. 13] where the connection with certain types of visibility graphs was explored. A notion related to geometrical thickness is that of (graph theoretical) thickness of a graph, #(G) which has been studied extensively [1, 3, 8, 9, 10, 14, 16] and has been defined as the minimum number of planar graphs into which a graph can be decomposed. The key di#erence between geometric thickness and graph theoretical thickness is that geometric thickness requires that the vertex placements be consistent at all layers and that straight line edges ....
V.B.AlekseevandV.S.Goncakov. The thickness of an arbitrary complete graph. Math USSR Sbornik, 30(2):187--202, 1976.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC