G-2021-25
Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph
, , et référence BibTeX
We study the average number \(A(G)\)
of colors in the non-equivalent colorings of a graph \(G\)
. We show some general properties of this graph invariant and determine its value for some classes of graphs. We then conjecture several lower bounds on \(A(G)\)
and prove that these conjectures are true for specific classes of graphs such as triangulated graphs and graphs with maximum degree at most 2.
Paru en avril 2021 , 18 pages
Axe de recherche
Publication
août 2023
, , et
Discrete Applied Mathematics, 335, 69–81, 2023
référence BibTeX