AbstractLet V be a family of even disjoint line segments in Rn of f-equal width for a direction f∈(Rn)∗(n⩾2), or even disjoint curve segments in Rn of fn-equal width, where fn is the normal direction for bases (n⩾2), or even disjoint twisted triangular prisms in R3 of f3-equal width. We prove that V has a perfect matching by open disjoint line segments in the complementary domain of the union of all the elements of V
We consider matchings with diametral disks between two sets of points R and B. More precisely, for e...
D. Tóth We prove that for every k ∈ N there is a constant ck> 0 with the following property. Eve...
AbstractConsider a graph G which is a union of m spanning subgraphs regular of degree k. We show tha...
AbstractLet V be a family of even disjoint line segments in Rn of f-equal width for a direction f∈(R...
Abstract In memory of our friend, Ferran Hurtado. Given a set S = {R 1 , R 2 , . . . , R 2n } of 2n ...
AbstractThis paper studies non-crossing geometric perfect matchings. Two such perfect matchings are ...
AbstractLet C be any family of 2n disjoint compact convex sets in the plane. If C has f-equal width ...
© 2021 Elsevier B.V.We prove that for all positive integers n and k, there exists an integer N=N(n,k...
In this thesis we adapt fundamental parts of the Graph Minors series of Robertson and Seymour for th...
In this note we are concerned with the existence of matchings and families of disjoint paths between...
AbstractIn this note we are concerned with the existence of matchings and families of disjoint paths...
AbstractA graph G satisfies the neighborhood condition ANC(G) ⩾ m if, for all pairs of vertices of G...
AbstractLet G be a graph with at least 2(m + n + 1) vertices. Then G is E(m, n) if for each pair of ...
summary:We give a necessary and sufficient condition for the existence of perfect matchings in a pla...
Abstract. Given a set S of line segments in the plane, we introduce a new family of partitions of th...
We consider matchings with diametral disks between two sets of points R and B. More precisely, for e...
D. Tóth We prove that for every k ∈ N there is a constant ck> 0 with the following property. Eve...
AbstractConsider a graph G which is a union of m spanning subgraphs regular of degree k. We show tha...
AbstractLet V be a family of even disjoint line segments in Rn of f-equal width for a direction f∈(R...
Abstract In memory of our friend, Ferran Hurtado. Given a set S = {R 1 , R 2 , . . . , R 2n } of 2n ...
AbstractThis paper studies non-crossing geometric perfect matchings. Two such perfect matchings are ...
AbstractLet C be any family of 2n disjoint compact convex sets in the plane. If C has f-equal width ...
© 2021 Elsevier B.V.We prove that for all positive integers n and k, there exists an integer N=N(n,k...
In this thesis we adapt fundamental parts of the Graph Minors series of Robertson and Seymour for th...
In this note we are concerned with the existence of matchings and families of disjoint paths between...
AbstractIn this note we are concerned with the existence of matchings and families of disjoint paths...
AbstractA graph G satisfies the neighborhood condition ANC(G) ⩾ m if, for all pairs of vertices of G...
AbstractLet G be a graph with at least 2(m + n + 1) vertices. Then G is E(m, n) if for each pair of ...
summary:We give a necessary and sufficient condition for the existence of perfect matchings in a pla...
Abstract. Given a set S of line segments in the plane, we introduce a new family of partitions of th...
We consider matchings with diametral disks between two sets of points R and B. More precisely, for e...
D. Tóth We prove that for every k ∈ N there is a constant ck> 0 with the following property. Eve...
AbstractConsider a graph G which is a union of m spanning subgraphs regular of degree k. We show tha...