Zobrazeno 1 - 5
of 5
pro vyhledávání: '"05C10 (Primary) 68R10 (Secondary)"'
Let $S$ be a point set in the plane, $\mathcal{P}(S)$ and $\mathcal{C}(S)$ sets of all plane spanning paths and caterpillars on $S$. We study reconfiguration operations on $\mathcal{P}(S)$ and $\mathcal{C}(S)$. In particular, we prove that all of the
Externí odkaz:
http://arxiv.org/abs/2410.07419
We deal with the problem of decomposing a complete geometric graph into plane star-forests. In particular, we disprove a recent conjecture by Pach, Saghafian and Schnider by constructing for each $n$ a complete geometric graph on $n$ vertices which c
Externí odkaz:
http://arxiv.org/abs/2402.11044
Autor:
Kynčl, Jan, Soukup, Jan
We prove the following variant of Levi's Enlargement Lemma: for an arbitrary arrangement $\mathcal{A}$ of $x$-monotone pseudosegments in the plane and a pair of points $a,b$ with distinct $x$-coordinates and not on the same pseudosegment, there exist
Externí odkaz:
http://arxiv.org/abs/2312.17675
Autor:
Jelínek, Vít, Jelínková, Eva, Kratochvíl, Jan, Lidický, Bernard, Tesař, Marek, Vyskočil, Tomš
It is known that every planar graph has a planar embedding where edges are represented by non-crossing straight-line segments. We study the planar slope number, i.e., the minimum number of distinct edge-slopes in such a drawing of a planar graph with
Externí odkaz:
http://arxiv.org/abs/1012.4137
Publikováno v:
ResearcherID
It is known that every planar graph has a planar embedding where edges are represented by non-crossing straight-line segments. We study the planar slope number, i.e., the minimum number of distinct edge-slopes in such a drawing of a planar graph with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24fa0f6d65fde54492db600572d344ba
https://doi.org/10.1007/s00373-012-1157-z
https://doi.org/10.1007/s00373-012-1157-z
