On the edge crossing properties of Euclidean minimum weight Laman graphs
Authors:
- Sergey BeregSBSergey Bereg
- Seok-Hee HongSHSeok-Hee Hong
- Naoki KatohNKNaoki Katoh
- Sheung-Hung PoonSPSheung-Hung Poon
- Shin-Ichi TanigawaSTShin-Ichi Tanigawa
- 1 January 2016
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 51, 15-24
Abstract
No abstract availableFunding Information
- University of Sydney
This publication has 11 references indexed in Scilit:
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation systemTheoretical Computer Science, 2013
- Some properties of k-Delaunay and k-Gabriel graphsComputational Geometry, 2013
- The Number of Edges in $k$-Quasi-planar GraphsSIAM Journal on Discrete Mathematics, 2013
- Minimal Obstructions for 1‐Immersions and Hardness of 1‐Planarity TestingJournal of Graph Theory, 2012
- On crossing numbers of geometric proximity graphsComputational Geometry, 2011
- On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing EdgesDiscrete & Computational Geometry, 2009
- Pebble game algorithms and sparse graphsDiscrete Mathematics, 2008
- Algorithms for Graphs Embeddable with Few Crossings per EdgeAlgorithmica, 2007
- Quasi-planar graphs have a linear number of edgesCombinatorica, 1997
- On graphs and rigidity of plane skeletal structuresJournal of Engineering Mathematics, 1970