An improved procedure for colouring graphs of bounded local density

Eoin Hurley, Rémi de Joannis de Verclos, Ross J. Kang

Type: Preprint

Publication Date: 2020-01-01

Citations: 1

DOI: https://doi.org/10.48550/arxiv.2007.07874

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	An improved procedure for colouring graphs of bounded local density	2021	Eoin Hurley Rémi de Joannis de Verclos Ross J. Kang
+ PDF Chat	An improved procedure for colouring graphs of bounded local density	2022	Eoin Hurley Rémi de Joannis de Verclos Ross J. Kang
+	Colouring Graphs with Sparse Neighbourhoods: Bounds and Applications	2018	Marthe Bonamy Thomas Perrett Luke Postle
+ PDF Chat	Colouring graphs with sparse neighbourhoods: Bounds and applications	2022	Marthe Bonamy Thomas Perrett Luke Postle
+	Colouring locally sparse graphs with the first moment method	2021	François Pirot Eoin Hurley
+	Colouring locally sparse graphs with the first moment method.	2021	François Pirot Eoin Hurley
+	New upper bounds on the chromatic number of a graph	2006	Landon Rabern
+ PDF Chat	A Local Epsilon Version of Reed's Conjecture	2017	Tom Kelly Luke Postle
+	Bounding $χ$ by a fraction of $Δ$ for graphs without large cliques	2018	Marthe Bonamy Tom Kelly Peter S. Nelson Luke Postle
+	Sparse partition universal graphs for graphs of bounded degree	2011	Yoshiharu Kohayakawa Vojtěch Rödl Mathias Schacht Endre Szemerédi
+	An algorithmic framework for colouring locally sparse graphs	2020	Ewan Davies Ross J. Kang François Pirot Jean‐Sébastien Sereni
+	Another approach to non-repetitive colorings of graphs of bounded degree	2020	Matthieu Rosenfeld
+ PDF Chat	A Stronger Bound for the Strong Chromatic Index	2017	Henning Bruhn Felix Joos
+	Distance edge-colourings and matchings	2012	Ross J. Kang Putra Manggala
+ PDF Chat	A stronger bound for the strong chromatic index	2015	Henning Bruhn Felix Joos
+	A stronger bound for the strong chromatic index	2015	Henning Bruhn Felix Joos
+	A stronger bound for the strong chromatic index	2015	Henning Bruhn Felix Joos
+	Another approach to non-repetitive colorings of graphs of bounded degree	2020	Matthieu Rosenfeld
+	A local epsilon version of Reed's Conjecture	2019	Tom Kelly Luke Postle
+	Switching Colouring of G(n,d/n) for Sampling up to Gibbs Uniqueness Threshold	2014	Charilaos Efthymiou

Works That Cite This (1)

Action	Title	Year	Authors
+ PDF Chat	Coloring, List Coloring, and Painting Squares of Graphs (and Other Related Problems)	2023	Daniel W. Cranston

Works Cited by This (0)

Action	Title	Year	Authors