Results 1 
2 of
2
On Linear Layouts of Graphs
, 2004
"... In a total order of the vertices of a graph, two edges with no endpoint in common can be crossing, nested, or disjoint. A kstack (resp... ..."
Abstract

Cited by 31 (19 self)
 Add to MetaCart
In a total order of the vertices of a graph, two edges with no endpoint in common can be crossing, nested, or disjoint. A kstack (resp...
Nothreeinlinein3D
 In Proc. 12th Int. Symp. on Graph Drawing (GD’04) [GD004
, 2004
"... The nothreeinline problem, introduced by Dudeney in 1917, asks for the maximum number of points in the nn grid with no three points collinear. In 1951, Erdos proved that the answer is (n). We consider the analogous threedimensional problem, and prove that the maximum number of points in the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The nothreeinline problem, introduced by Dudeney in 1917, asks for the maximum number of points in the nn grid with no three points collinear. In 1951, Erdos proved that the answer is (n). We consider the analogous threedimensional problem, and prove that the maximum number of points in the n n n grid with no three collinear is (n ).