Number of crossing-free geometric graphs vs. Triangulations

From MaRDI portal
Publication:5301006

DOI10.1016/J.ENDM.2008.06.039zbMATH Open1267.05097OpenAlexW1965976352WikidataQ54308706 ScholiaQ54308706MaRDI QIDQ5301006FDOQ5301006


Authors: Andreas Razen, Jack Snoeyink, Emo Welzl Edit this on Wikidata


Publication date: 28 June 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2008.06.039




Recommendations




Cites Work


Cited In (13)





This page was built for publication: Number of crossing-free geometric graphs vs. Triangulations

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