Improving upper and lower bounds for the total number of edge crossings of Euclidean minimum weight Laman graphs

DOI10.1007/978-3-030-89543-3_21OpenAlexW3208750771MaRDI QIDQ2695292

Yuya Higashikawa, Yuki Kobayashi, Naoki Katoh

Publication date: 30 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-89543-3_21

zbMATH Keywords

geometric graphsplane graphsedge crossingslaman graphssparse and tight graphs

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• On crossing numbers of geometric proximity graphs
• Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs
• On the edge crossing properties of Euclidean minimum weight Laman graphs
• Enumerating constrained non-crossing minimally rigid frameworks
• Pebble game algorithms and sparse graphs
• On graphs and rigidity of plane skeletal structures
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems

This page was built for publication: Improving upper and lower bounds for the total number of edge crossings of Euclidean minimum weight Laman graphs