Left ternary trees and non-separable rooted planar maps
From MaRDI portal
Publication:1575943
DOI10.1016/S0304-3975(98)00025-5zbMath0952.68117OpenAlexW2066480898WikidataQ126834833 ScholiaQ126834833MaRDI QIDQ1575943
Jean-Guy Penaud, Francesco Del Ristoro, Alberto del Lungo
Publication date: 23 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00025-5
General low-dimensional topology (57M99) Enumeration in graph theory (05C30) Discrete mathematics in relation to computer science (68R99)
Related Items (7)
A bijection for triangulations of a polygon with interior points and multiple edges ⋮ Fighting fish and two-stack sortable permutations ⋮ Bijections between fighting fish, planar maps, and Tamari intervals ⋮ Fighting fish ⋮ A bijection between Tamari intervals and extended fighting fish ⋮ Fighting fish: enumerative properties ⋮ In memoriam: Alberto Del Lungo (1965--2003)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A bijective census of nonseparable planar maps
- A methodology for plane tree enumeration
- Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
- Planar Maps are Well Labeled Trees
- A Census of Planar Maps
- Enumeration of Non-Separable Planar Maps
This page was built for publication: Left ternary trees and non-separable rooted planar maps