Packing plane spanning trees and paths in complete geometric graphs

Oswin Aichholzer, Thomas Hackl, Matias Korman, Marc Van Kreveld, Maarten Löér, Alexander Pilz, Bettina Speckmann, Emo Welzl

Research output: Contribution to conferencePaperpeer-review

4 Citations (Scopus)

Abstract

We consider the following question: How many edgedisjoint plane spanning trees are contained in a complete geometric graph GKn on any set S of n points in general position in the plane?

Original languageEnglish
Pages233-238
Number of pages6
Publication statusPublished - 2014
Externally publishedYes
Event26th Canadian Conference on Computational Geometry, CCCG 2014 - Halifax, Canada
Duration: 2014 Aug 112014 Aug 13

Other

Other26th Canadian Conference on Computational Geometry, CCCG 2014
CountryCanada
CityHalifax
Period14/8/1114/8/13

ASJC Scopus subject areas

  • Geometry and Topology
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Packing plane spanning trees and paths in complete geometric graphs'. Together they form a unique fingerprint.

Cite this