A combinatorial identity concerning plane colored trees and its applications

zbMATH Open1355.05045MaRDI QIDQ2963483FDOQ2963483

Authors: Ricky X. F. Chen, Christian M. Reidys 

Publication date: 14 February 2017

Full work available at URL: http://www.emis.de/journals/JIS/VOL20/Chen/chen32.html

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

Recommendations

• An identity involving Narayana numbers
• A new combinatorial identity for unicellular maps, via a direct bijective approach
• scientific article; zbMATH DE number 6909270
• A simple model of trees for unicellular maps
• A combinatorial identity with applications to forest graphs

zbMATH Keywords

Harer-Zagier formulaNarayana polynomialcolored treeStanley's bijective proof problem

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial identities, bijective combinatorics (05A19) Coloring of graphs and hypergraphs (05C15)

Cited In (3)

• Title not available (Why is that?)
• A generalization of the Ramanujan polynomials and plane trees
• On generating series of coloured planar trees

Uses Software

• OEIS

This page was built for publication: A combinatorial identity concerning plane colored trees and its applications

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