|
|
|
|
|
The chromatic
polynomial of a graph
D. H. Lehmer |
|
Vol. 118 (1985), No. 2, 463–469
|
Abstract |
|
The problem of which polynomials occur as the vertex coloring of a graph is studied. The results are complete for graphs with fewer than seven vertices. |
Mathematical Subject Classification 2000
Primary: 05C15
|
Milestones
Received: 7 June 1984
Published: 1 June 1985
|
Authors |
| D. H. Lehmer | |
|
