New bounds and an FPT algorithm for plane cycles in geometric bipartite graphs, but the main characterization theorem is refuted by a four-point counterexample.
Bicolored point sets admitting non-crossing alternating Hamiltonian paths
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Consider a bicolored point set $P$ in general position in the plane consisting of $n$ blue and $n$ red points. We show that if a subset of the red points forms the vertices of a convex polygon separating the blue points, lying inside the polygon, from the remaining red points, lying outside the polygon, then the points of $P$ can be connected by non-crossing straight-line segments so that the resulting graph is a properly colored closed Hamiltonian path.
fields
cs.CG 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
On plane cycles in geometric multipartite graphs
New bounds and an FPT algorithm for plane cycles in geometric bipartite graphs, but the main characterization theorem is refuted by a four-point counterexample.