Nowhere-Harmonic Colorings of Graphs - Mathematics > CombinatoricsReport as inadecuate

Nowhere-Harmonic Colorings of Graphs - Mathematics > Combinatorics - Download this document for free, or read online. Document in PDF available to download.

Abstract: Proper vertex colorings of a graph are related to its boundary map, alsocalled its signed vertex-edge incidence matrix. The vertex Laplacian of agraph, a natural extension of the boundary map, leads us to introducenowhere-harmonic colorings and analogues of the chromatic polynomial andStanley-s theorem relating negative evaluations of the chromatic polynomial toacyclic orientations. Further, we discuss some examples demonstrating thatnowhere-harmonic colorings are more complicated from an enumerative perspectivethan proper colorings.

Author: Matthias Beck, Benjamin Braun



Related documents