Injectively \(k\)-colored rooted forests

DOI10.1007/s00373-023-02700-5zbMath1526.05047arXiv2107.13417OpenAlexW3185161958MaRDI QIDQ6063282

Robert Muth, Jeffrey Wilkinson, Thomas Einolf

Publication date: 7 November 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2107.13417

zbMATH Keywords

treesCatalan numbersforestsenumerative combinatoricsgraph colorings

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) General convexity (52A99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Raney numbers and \((s,s+1)\)-core partitions
• Some bijections and identities for the Catalan and Fine numbers
• Multivariate Fuss-Catalan numbers
• Catalan numbers, their generalization, and their uses
• Enumeration of plane trees by branches and endpoints
• A short proof of Chvatal's Watchman Theorem
• Good and semi-strong colorings of oriented planar graphs
• The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
• A combinatorial theorem in plane geometry
• Fighting fish: enumerative properties
• Ordered trees with prescribed root degrees, node degrees, and branch lengths
• On the injective chromatic number of graphs
• The On-Line Encyclopedia of Integer Sequences
• A study on the injective coloring parameters of certain graphs
• Equitable Coloring
• Injective Oriented Colourings
• Injective coloring of planar graphs

This page was built for publication: Injectively \(k\)-colored rooted forests