8 citations · 11 across the 9 of their papers we have counts for
4 papers · 1 filter
Further Progress towards the List and Odd Versions of Hadwiger's Conjecture
Luke Postle
In 1943, Hadwiger conjectured that every graph with no minor is -colorable for every . In the 1980s, Kostochka and Thomason independently proved that every gra…
On decidability of hyperbolicity
Zdeněk Dvořák, Luke Postle
We prove that a wide range of coloring problems in graphs on surfaces can be resolved by inspecting a finite number of configurations.
Fractional vertex-arboricity of planar graphs
Marthe Bonamy, František Kardoš, Tom Kelly +1
We initiate a systematic study of the fractional vertex-arboricity of planar graphs and demonstrate connections to open problems concerning both fractional coloring and the size of…
Connectivity and choosability of graphs with no minor
Sergey Norin, Luke Postle
In 1943, Hadwiger conjectured that every graph with no minor is -colorable for every . While Hadwiger's conjecture does not hold for list-coloring, the linear…