scientific article; zbMATH DE number 7471007

zbMath1485.11052arXiv2104.00552MaRDI QIDQ5026930

Alain Hertz, Hadrien Mélot, Anaelle Hertz

Publication date: 8 February 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graph coloringBell numberStirling number

Mathematics Subject Classification ID

Bell and Stirling numbers (11B73) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Emerging applications, models and algorithms in combinatorial optimization ⋮ Upper bounds on the average number of colors in the non-equivalent colorings of a graph ⋮ Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph

Cites Work

• Counting the number of non-equivalent vertex colorings of a graph
• On the number of distinct block sizes in partitions of a set
• On the average rank of an element in a filter of the partition lattice
• A sharp lower bound on the number of non-equivalent colorings of graphs of order \(n\) and maximum degree \(n - 3\)
• Stirling numbers of forests and cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: