Coding properties of breadth-first search orderings

zbMATH Open1412.05099MaRDI QIDQ2816129FDOQ2816129

Authors: P. Ossona de Mendez, Pierre Rosenstiehl 

Publication date: 1 July 2016

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065305801787?np=y

Recommendations

• A bijection between ordered trees and bicoloured ordered trees
• A generic method for bijections between blossoming trees and planar maps
• Counting outerplanar maps
• A bijective census of nonseparable planar maps
• On encodings of spanning trees

zbMATH Keywords

BFSbreadth-first searchcodegraph drawingmapcombinatorial bijectiondouble occurrence sequenceconnected involution

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Enumeration in graph theory (05C30) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (2)

• Breadth-first numbering
• Breadth first search coding of multitype forests with application to Lamperti representation

This page was built for publication: Coding properties of breadth-first search orderings

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