Access the full text.
Sign up today, get DeepDyve free for 14 days.
W. Tutte (1970)
On chromatic polynomials and the golden ratioJournal of Combinatorial Theory, Series A, 9
R. Liu (1987)
ON CHROMATIC POLYNOMIALS OF TWO CLASSES OF GRAPHS
Qingyan Du (1996)
Chromaticity of the complements of paths and cyclesDiscret. Math., 162
Ruying Liu, Lian-Chang Zhao (1997)
A new method for proving chromatic uniqueness of graphsDiscret. Math., 171
L. Yanpei (1987)
Chromatic sum equations for rooted cubic planar mapsActa Mathematicae Applicatae Sinica, 3
K. Jetter (1984)
Ein kurze Anmerkung zur Romberg-IntegrationNumerische Mathematik, 45
G. Chia (1986)
A note on chromatic uniqueness of graphsJournal of Graph Theory, 10
In this paper, a new method is used to calculate the chromatic polynomials of graphs. The chromatic polynomials of the complements of a wheel and a fan are determined. Furthermore, the adjoint polynomials of F n with n vertices are obtained. This supports a conjecture put forward by R.Y. Liu et al.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Jun 1, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.