Note on the number of proper colorings of a graph
From MaRDI portal
Publication:6477809
arXivmath/0609179MaRDI QIDQ6477809FDOQ6477809
Authors: Martin Klazar 
Publication date: 6 September 2006
Abstract: We present a simpler proof of a bound on the number of proper colorings of a graph that was obtained recently by Liu and Murty using Tur'an sieve (in fact, we prove a stronger inequality). We also point out that these results are subsumed in a stronger result due to Lazebnik in 1990.
This page was built for publication: Note on the number of proper colorings of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6477809)
