Author:
Bartels J. Eric,Welsh Dominic J. A.
Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Francesco Brenti. Expansions of chromatic polynomials and log-concavity. Transactions of the American Mathematical Society, 332(2):729–756, 1992.
2. Mark Jerrum. A very simple algorithm for estimating the number of k-colourings of a low-degree graph. Random Structures and Algorithms, to appear 1995.
3. F. Jaeger, D.L. Vertigan, and D.J.A. Welsh. On the computational complexity of the Jones and Tutte polynomials. Mathematical Proceedings of the Cambridge Philosophical Society, 108:35–53, 1990.
4. G. Rote. Personal communication.
5. R.C. Read and W.T. Tutte. Chromatic polynomials. In L.W. Beineke and R.J. Wilson, editors, Selected Topics in Graph Theory, pages 15–42. Academic Press Ltd, London, 1988.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Mean Color Numbers of Some Graphs;Graphs and Combinatorics;2021-12-16
2. Bounds for mean colour numbers of graphs;Journal of Combinatorial Theory, Series B;2003-03
3. Two Conjectures on the Chromatic Polynomial;Lecture Notes in Computer Science;2000
4. Two Chromatic Polynomial Conjectures;Journal of Combinatorial Theory, Series B;1997-05
5. Some Problems on Approximate Counting in Graphs and Matroids;Research Trends in Combinatorial Optimization