|
|||||
|
|
Graphs with least number of colorings |
|
| Authors: | A. Sakaloglu A. Satyanarayana |
| Affiliation: | Department of Electrical Engineering and Computer Science Stvens Institute of Technology Hoboken New Jersey |
| Abstract: | A λ-coloring of a graph G is an assignment of λ or fewer colors to the points of G so that no two adjacent points have the same color. Let Ω (n,e) be the collection of all connected n-point and e-edge graphs and let Ωp(n,e) be the planar graphs of Ω(n, e). This paper characterizes the graphs that minimize the number of λ-colorings in Ω(n, e) for all λ > 1 and Ωp(n,e) for all λ.4. © 1995 John Wiley & Sons, Inc. |
| Keywords: | |