Bibliographic Details
| Title: |
Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph. |
| Authors: |
Hertz, Alain1 (AUTHOR) alain.hertz@gerad.ca, Mélot, Hadrien2 (AUTHOR), Bonte, Sébastien2 (AUTHOR), Devillez, Gauvain2 (AUTHOR), Hauweele, Pierre2 (AUTHOR) |
| Superior Title: |
Graphs & Combinatorics. May2023, Vol. 39 Issue 3, p1-22. 22p. |
| Subject Terms: |
*GRAPH coloring, *COLORS, *COLOR |
| Abstract: |
A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they induce the same partition of the vertex set into color classes. Let A (G) be the average number of colors in the non-equivalent colorings of a graph G. We give a general upper bound on A (G) that is valid for all graphs G and a more precise one for graphs G of order n and maximum degree Δ (G) ∈ { 1 , 2 , n - 2 } . [ABSTRACT FROM AUTHOR] |
|
Copyright of Graphs & Combinatorics is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Academic Search Premier |
|
Full text is not displayed to guests. |
Login for full access.
|