Title of article
A new method for proving chromatic uniqueness of graphs Original Research Article
Author/Authors
Ruying Liu، نويسنده , , Lian-Chang Zhao، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
9
From page
169
To page
177
Abstract
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.
Journal title
Discrete Mathematics
Serial Year
1997
Journal title
Discrete Mathematics
Record number
951536
Link To Document