On the edge crossing properties of Euclidean minimum weight Laman graphs

DOI10.1007/978-3-642-45030-3_4zbMATH Open1321.05166OpenAlexW2177982915WikidataQ62041776 ScholiaQ62041776MaRDI QIDQ2872069FDOQ2872069

Authors: Sergey Bereg, Seok-Hee Hong, Naoki Katoh, Sheung-Hung Poon, Shin-Ichi Tanigawa 

Publication date: 14 January 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45030-3_4

Recommendations

• On the edge crossing properties of Euclidean minimum weight Laman graphs
• On the minimum weight of a 3-connected 1-planar graph
• On the Size of Planarly Connected Crossing Graphs
• On the size of planarly connected crossing graphs
• Crossing and Weighted Crossing Number of Near-Planar Graphs

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

This page was built for publication: On the edge crossing properties of Euclidean minimum weight Laman graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2872069)