A combinatorial link between labelled graphs and increasingly labelled Schröder trees

DOI10.1007/978-3-031-20624-5_30MaRDI QIDQ6109027

Mehdi Naima, Olivier Bodini, Antoine Genitrini

Publication date: 26 July 2023

Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)

zbMATH Keywords

combinatoricsincreasing treeslabelled graphsevolution processuniform samplingSchröder treesmonotonic trees

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Alternating permutations and binary increasing trees
• A calculus for the random generation of labelled combinatorial structures
• Enumerative applications of a decomposition for graphs and digraphs
• Weakly increasing trees on a multiset
• Counting directed acyclic and elementary digraphs
• Critical phenomena in natural sciences. Chaos, fractals, selforganization and disorder: Concepts and tools.
• Acyclic orientations of graphs
• Strict monotonic trees arising from evolutionary processes: combinatorial and probabilistic study
• Plane recursive trees, Stirling permutations and an urn model
• Random Trees
• On the Altitude of Nodes in Random Trees
• Increasing trees and alternating permutations
• Ranked Schröder Trees
• Mathematical Foundations of Computer Science 2003
• Random Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A combinatorial link between labelled graphs and increasingly labelled Schröder trees