Jump to content

Blossom tree (graph theory)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Happysquirrel (talk | contribs) at 02:23, 21 December 2015 (top: add definition). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In the study of planar graphs, blossom trees are rooted trees with aditional directed half edges. Each blossom tree is associated with an embedding of a planar graph. Blossom trees can be used to sample random planar graphs.[1]

Description

A blossom tree is constructed from a rooted tree embedded in the plane by adding opening and closing stems to vertices. The number of opening and closing stems must match.[2]

References

  1. ^ Albenque, Marie; Poulalhon, Dominique (2015). "Generic method for bijections between blossoming trees and planar maps". arXiv:1305.1312v3.
  2. ^ Albenque, Marie. "Blossoming trees and planar maps" (PDF). Retrieved 21 December 2015.