J. Vasak. The thickness of the complete graph having 6m +4points. Manuscript. Cited in [12, 14].  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Geometric Thickness of Complete Graphs - Dillencourt, Eppstein, Hirschberg (1999) (8 citations) (Correct)
....be reassigned arbitrarily in the plane without altering the topology of the planar embedding provided we are allowed to bend the edges at will [10] This observation is easily verified by induction, moving one vertex at a time. The (graph theoretical) thickness is now known for all complete graphs [1, 2, 3, 12, 13], and is given by the following formula: Kn ) 8 : 1; 1 n 4 2; 5 n 8 3; 9 n 10 Sigma n 2 6 Upsilon ; n 10 (1:1) Another notion related to geometric thickness is the book thickness of a graph G, bt(G) defined as follows [4] A book with k pages or a k book , is a ....
J. Vasak. The thickness of the complete graph having 6m+ 4 points. Manuscript. Cited in [8, 9]. This article was processed using the L a T E X macro package with LLNCS style
Geometric Thickness of Complete Graphs - Dillencourt, Eppstein, Hirschberg (2000) (8 citations) (Correct)
No context found.
J. Vasak. The thickness of the complete graph having 6m +4points. Manuscript. Cited in [12, 14].
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