A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree (2023)
Attributed to:
Approximate structure in large graphs and hypergraphs
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1017/s0963548323000299
Publication URI: http://dx.doi.org/10.1017/s0963548323000299
Type: Journal Article/Review
Parent Publication: Combinatorics, Probability and Computing
ISSN: 0963-5483