8 citations · 11 across the 9 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017★ 1 cited
The List Linear Arboricity of Graphs
Ringi Kim, Luke Postle
A linear forest is a forest in which every connected component is a path. The linear arboricity of a graph is the minimum number of linear forests of covering all edges. In…
math.CO2017
3 List Coloring Graphs of Girth at least Five on Surfaces
Luke Postle
Grotzsch proved that every triangle-free planar graph is 3-colorable. Thomassen proved that every planar graph of girth at least five is 3-choosable. As for other surfaces, Thomass…
math.CO2017★ 1 cited
On the clique number of the square of a line graph and its relation to Ore-degree
Maxime Faron, Luke Postle
In 1985, Erdős and Nešetřil conjectured that the square of the line graph of a graph , that is , can be colored with colors. This conjecture implies…