Upper bounds on the average number of colors in the non-equivalent colorings of a graph
From MaRDI portal
Publication:6045131
DOI10.1007/s00373-023-02637-9zbMath1518.05064arXiv2105.01120OpenAlexW3159107677MaRDI QIDQ6045131
Pierre Hauweele, Sébastien Bonte, Alain Hertz, Hadrien Mélot, Gauvain Devillez
Publication date: 26 May 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.01120
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
- 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
- Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Upper bounds on the average number of colors in the non-equivalent colorings of a graph