A lower bound on the size of universal sets for planar graphs
ACM SIGACT News
On a straight-line embedding problem of graphs
Discrete Mathematics - Special issue: selected papers in honour of Paul Erdo&huml;s on the occasion of his 80th birthday
Bipartite embedding of trees in the plane
Discrete Applied Mathematics
A note on harmonic subgraphs in labelled geometric graphs
Information Processing Letters
Hamiltonian Alternating Paths on Bicolored Double-Chains
Graph Drawing
Hi-index | 0.00 |
Given n red and n blue points in convex position in the plane, we show that there exists a noncrossing alternating path of length $n+c\sqrt{n\over \log n}$. We disprove a conjecture of Erdős by constructing an example without any such path of length greater than ${4\over 3}n+c'\sqrt{n}$.