A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On Paths in a Complete Bipartite Geometric Graph
[chapter]

2001
*
Lecture Notes in Computer Science
*

Let A and B be two disjoint sets of points in the plane such that no three points of A ∪ B are collinear, and let n be the number of points in A. A geometric complete bipartite graph K(A, B) is a complete bipartite graph with partite sets A and B which is drawn in the plane such that each edge of K (A, B) is a straight-line segment. We prove that (i) If |B| ≥ (n + 1)(2n − 4) + 1, then the geometric complete bipartite graph K(A, B) contains a path that passes through all the points in A and has

doi:10.1007/3-540-47738-1_17
fatcat:3btm6riw4rd55atqv55erxzdde