We derive this result from a general technique to bound the chromatic number of a graph where no vertex has many edges in its neighbourhood.
Oct 15, 2018 · We derive this result from a general technique to bound the chromatic number of a graph where no vertex has many edges in its neighbourhood.
Colouring graphs with sparse neighbourhoods - ScienceDirect.com
www.sciencedirect.com › article › pii
We derive this result from a general technique to bound the chromatic number of a graph where no vertex has many edges in its neighbourhood.
Oct 17, 2018 · Colouring graphs with sparse neighbourhoods: Bounds and applications. Bonamy, Marthe; Perrett, Thomas; Postle, Luke. Published in: Journal of ...
Semantic Scholar extracted view of "Colouring Graphs with Sparse Neighbourhoods: Bounds and Applications" by Marthe Bonamy et al.
We derive this result from a general technique to bound the chromatic number of a graph where no vertex has many edges in its neighbourhood. Our improvements to ...
We derive this result from a general technique to bound the chromatic number of a graph where no vertex has many edges in its neighbourhood.
Note that by Lemma 2.5, dt is an upper bound for the maximum degree and st is an upper bound for the number of edges spanned by the neighborhood of any vertex ...
Missing: Applications. | Show results with:Applications.
We derive this result from a general technique to bound the chromatic number of a graph where no vertex has many edges in its neighbourhood. Our improvements to ...
We derive this result from a general technique to bound the chromatic number of a graph where no vertex has many edges in its neighbourhood. Our improvements to ...