Items where authors include "Greenhill, C"
Article
Dyer, M orcid.org/0000-0002-2018-0374, Greenhill, C, Kleer, P et al. (2 more authors) (2021) Sampling hypergraphs with given degrees. Discrete Mathematics, 344 (11). 112566. ISSN 0012-365X
Dyer, M orcid.org/0000-0002-2018-0374, Greenhill, C and Müller, H orcid.org/0000-0002-1123-1774 (2021) Counting independent sets in graphs with bounded bipartite pathwidth. Random Structures & Algorithms, 59 (2). pp. 204-237. ISSN 1042-9832
Cooper, C, Dyer, M, Greenhill, C et al. (1 more author) (2019) The flip Markov chain for connected regular graphs. Discrete Applied Mathematics, 254. pp. 56-79. ISSN 0166-218X
Dyer, M, Frieze, A and Greenhill, C (2015) On the chromatic number of a random hypergraph. Journal of Combinatorial Theory, Series B, 113. pp. 68-122. ISSN 0095-8956
Dyer, M, Greenhill, C and Ullrich, M (2014) Structure and eigenvalues of heat-bath Markov chains. Linear Algebra and Its Applications, 454. 57 - 71. ISSN 0024-3795
Proceedings Paper
Cooper, C, Dyer, M orcid.org/0000-0002-2018-0374 and Greenhill, C (2021) A Triangle Process on Regular Graphs. In: Combinatorial Algorithms. 32nd International Workshop, IWOCA 2021, 05-07 Jul 2021, Ottawa, ON, Canada. , pp. 310-323. ISBN 978-3-030-79986-1
Dyer, M, Greenhill, C and Müller, H (2019) Counting independent sets in graphs with bounded bipartite pathwidth. In: Sau, I and Thilikos, D, (eds.) Graph-Theoretic concepts in computer science. Lecture Notes in Computer Science 11789. WG 2019, 19-21 Jun 2019, Vall de Nuria, Catalonia, Spain. Springer Verlag . ISBN 9783030307851