Disjoint edges in geometric graphs

DOI10.1007/s00373-022-02563-2zbMath1504.05069arXiv2111.05425OpenAlexW3212310032WikidataQ114229593 ScholiaQ114229593MaRDI QIDQ5925578

Rinat Sadykov, Aleksandr A. Polyanskii, Nikita Chernega

Publication date: 28 September 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.05425

zbMATH Keywords

geometric graphsdisjoint edgespointed vertex

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric graphs with no three disjoint edges
• Some geometric applications of Dilworth's theorem
• On the smallest sets blocking simple perfect matchings in a convex geometric graph
• Geometric graphs with few disjoint edges
• Forcing disjoint segments in the plane
• Note on geometric graphs
• The Beginnings of Geometric Graph Theory
• On Sets of Distances of n Points
• Disjoint edges in geometric graphs

This page was built for publication: Disjoint edges in geometric graphs