Injectively k-colored rooted forests
From MaRDI portal
Publication:6063282
Abstract: We enumerate injectively -colored rooted forests with a given number of vertices of each color and a given sequence of root colors. We obtain from this result some new multi-parameter distributions of Fuss-Catalan numbers. As an additional application we enumerate triangulations of regular convex polygons according to their proper 3-coloring type.
Recommendations
Cites work
- A combinatorial theorem in plane geometry
- A short proof of Chvatal's Watchman Theorem
- A study on the injective coloring parameters of certain graphs
- An Tu Ming, the first discoverer of the Catalan numbers
- Catalan numbers, their generalization, and their uses
- Enumeration of plane trees by branches and endpoints
- Equitable Coloring
- Fighting fish: enumerative properties
- Good and semi-strong colorings of oriented planar graphs
- scientific article; zbMATH DE number 1354294 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 269845 (Why is no real title available?)
- scientific article; zbMATH DE number 2331355 (Why is no real title available?)
- Injective coloring of planar graphs
- Injective oriented colourings
- Multivariate Fuss-Catalan numbers
- Obstructions to injective oriented colourings
- On the injective chromatic number of graphs
- Ordered trees with prescribed root degrees, node degrees, and branch lengths
- Some bijections and identities for the Catalan and Fine numbers
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- The On-Line Encyclopedia of Integer Sequences
- The Raney numbers and (s,s+1)-core partitions
This page was built for publication: Injectively \(k\)-colored rooted forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6063282)