Some corollaries of a theorem of Whitney on the chromatic polynomial
- 19 January 1991
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 87 (1) , 53-64
- https://doi.org/10.1016/0012-365x(91)90070-i
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- New upper bounds for the greatest number of proper colorings of a (V,E)‐graphJournal of Graph Theory, 1990
- On the greatest number of 2 and 3 colorings of a (v, e)‐graphJournal of Graph Theory, 1989
- A theoretical analysis of backtracking in the graph coloring problemJournal of Algorithms, 1985
- Backtrack: An O(1) expected time algorithm for the graph coloring problemInformation Processing Letters, 1984
- The Chromatic Polynomial of a Complete Bipartite GraphThe American Mathematical Monthly, 1973
- Coefficients of chromatic polynomialsJournal of Combinatorial Theory, Series B, 1972
- Counting Coloured Graphs. IIICanadian Journal of Mathematics, 1972
- Triangles in an Ordinary GraphCanadian Journal of Mathematics, 1963
- A logical expansion in mathematicsBulletin of the American Mathematical Society, 1932
- A Determinant Formula for the Number of Ways of Coloring a MapAnnals of Mathematics, 1912