A new method for proving chromatic uniqueness of graphs
From MaRDI portal
Publication:1363698
DOI10.1016/S0012-365X(96)00078-7zbMath0881.05046OpenAlexW1974936586MaRDI QIDQ1363698
Publication date: 8 September 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00078-7
Related Items
Harary polynomials, One more remark on the adjoint polynomial, The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than \(-4\), On chromatic polynomials of some kinds of graphs, On problems and conjectures on adjointly equivalent graphs, On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs, On the minimum real roots of the adjoint polynomial of a graph
Cites Work