A new method for proving chromatic uniqueness of graphs

摘要

We give a brief survey on a new method for proving the chromatic uniqueness of graphs by their adjoint polynomials. We obtain some simpler proofs of relevant theorems and a new family of chromatically unique graphs.