Bounds on the maximum multiplicity of some common geometric graphs

DOI10.4230/LIPICS.STACS.2011.637MaRDI QIDQ3113726zbMATH OpenFDO

Authors Adrian Dumitrescu, André Schulz, Adam Sheffer, Csaba D. Tóth

Publication date 23 January 2012

Full work available at URL https://arxiv.org/abs/1012.5664, http://subs.emis.de/LIPIcs/frontdoor_d7f3.html

zbMATH Keywords

combinatorial geometrymatchingnon-crossing conditionspanning cyclespanning treetriangulationweighted structure

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial complexity of geometric structures (52C45) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Bounds on the maximum multiplicity of some common geometric graphs
• On the number of plane geometric graphs
• An improved lower bound on the maximum number of non-crossing spanning trees
• Lower bounds on the maximum number of non-crossing acyclic graphs
• Counting triangulations of planar point sets

Cited in

(11)

• On numbers of pseudo-triangulations
• Lower bounds on the maximum number of non-crossing acyclic graphs
• On the number of plane geometric graphs
• Bounds on the maximum multiplicity of some common geometric graphs
• scientific article; zbMATH DE number 2042236 (Why is no real title available?)
• Simultaneously flippable edges in triangulations
• Packing 1-plane Hamiltonian cycles in complete geometric graphs
• An improved lower bound on the maximum number of non-crossing spanning trees
• On the number of higher order Delaunay triangulations
• Long non-crossing configurations in the plane
• Chains, Koch chains, and point sets with many triangulations

This page was built for publication: Bounds on the maximum multiplicity of some common geometric graphs

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