Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference5 articles.
1. The Markov chain of colourings;Bartels;Lecture Notes in Computer Science,1995
2. Expansions of chromatic polynomials and log-concavity;Brenti;Trans. Amer. Math. Soc.,1992
3. M. Mosca, 1996, Removing edges can increase the expected number of colours in a colouring
4. An introduction to chromatic polynomials;Read;J. Combin. Theory,1968
5. Matroid Theory;Welsh,1976
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Mean Color Numbers of Some Graphs;Graphs and Combinatorics;2021-12-16
2. Problems on chromatic polynomials of hypergraphs;Electronic Journal of Graph Theory and Applications;2020-10-16
3. A note on the shameful conjecture;European Journal of Combinatorics;2015-07
4. Chromatic Polynomials of Simplicial Complexes;Graphs and Combinatorics;2015-05-01
5. On Brenti’s conjecture about the log-concavity of the chromatic polynomial;European Journal of Combinatorics;2012-11