On generating series of coloured planar trees

zbMATH Open1186.05008MaRDI QIDQ2654597FDOQ2654597

Authors: Roland Bacher, Gilles Schaeffer 

Publication date: 19 January 2010

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/225357

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Graph-Theoretic Concepts in Computer Science
• A note on trees colouring
• THE COLORING OF THE TREE OF COLORINGS
• A combinatorial identity concerning plane colored trees and its applications
• On purely tree-colorable planar graphs
• scientific article; zbMATH DE number 2210744
• Building graphs from colored trees
• Publication:4941827
• Reconstruction for Colorings on Trees
• Random generation of colored trees

zbMATH Keywords

generating functionplanar treeinversion of power series

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Cited In (7)

• On some tree-indexed series with one and two parameters
• Colored operads, series on colored operads, and combinatorial generating systems
• Enumeration and asymptotic formulas for rectangular partitions of the hypercube
• Building graphs from colored trees
• Title not available (Why is that?)
• Generation of colour-constrained spanning trees with application in symbolic circuit analysis
• Flows on rooted trees and the Menous-Novelli-Thibon idempotents

This page was built for publication: On generating series of coloured planar trees

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