Luke Postle

According to our database1, Luke Postle authored at least 43 papers between 2008 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Bounding the number of cycles in a graph in terms of its degree sequence.
Eur. J. Comb., 2021

2020
On decidability of hyperbolicity.
CoRR, 2020

An even better Density Increment Theorem and its application to Hadwiger's Conjecture.
CoRR, 2020

Further progress towards Hadwiger's conjecture.
CoRR, 2020

2019
Bounded diameter arboricity.
J. Graph Theory, 2019

On the clique number of the square of a line graph and its relation to maximum degree of the line graph.
J. Graph Theory, 2019

List coloring with requests.
J. Graph Theory, 2019

Planar graphs of girth at least five are square (Δ + 2)-choosable.
J. Comb. Theory, Ser. B, 2019

On the density of critical graphs with no large cliques.
CoRR, 2019

Halfway to Hadwiger's Conjecture.
CoRR, 2019

Improved Bounds for Randomly Sampling Colorings via Linear Programming.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018
Exponentially many 4-list-colorings of triangle-free graphs on surfaces.
J. Graph Theory, 2018

Five-list-coloring graphs on surfaces III. One list of size one and one list of size two.
J. Comb. Theory, Ser. B, 2018

Characterizing 4-critical graphs with Ore-degree at most seven.
J. Comb. Theory, Ser. B, 2018

Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8.
J. Comb. Theory, Ser. B, 2018

Chromatic index determined by fractional chromatic index.
J. Comb. Theory, Ser. B, 2018

Random 4-regular graphs have 3-star decompositions asymptotically almost surely.
Eur. J. Comb., 2018

Reconstruction of infinite matroids from their 3-connected minors.
Eur. J. Comb., 2018

Fractional coloring with local demands.
CoRR, 2018

Colouring Graphs with Sparse Neighbourhoods: Bounds and Applications.
CoRR, 2018

Rapid mixing of Glauber dynamics for colorings below Vigoda's 11/6 threshold.
CoRR, 2018

2017
On the Minimum Edge-Density of 4-Critical Graphs of Girth Five.
J. Graph Theory, 2017

5-list-coloring planar graphs with distant precolored vertices.
J. Comb. Theory, Ser. B, 2017

Modified linear programming and class 0 bounds for graph pebbling.
J. Comb. Optim., 2017

A Local Epsilon Version of Reed's Conjecture.
Electron. Notes Discret. Math., 2017

On the List Coloring Version of Reed's Conjecture.
Electron. Notes Discret. Math., 2017

On Star Decompositions of Random Regular Graphs.
Electron. Notes Discret. Math., 2017

On the minimum number of edges in triangle-free 5-critical graphs.
Eur. J. Comb., 2017

Density of 5/2-critical graphs.
Comb., 2017

2016
Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk.
J. Comb. Theory, Ser. B, 2016

The structure of 2-separations of infinite matroids.
J. Comb. Theory, Ser. B, 2016

Hyperbolic families and coloring graphs on surfaces.
CoRR, 2016

2015
Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs.
J. Comb. Theory, Ser. B, 2015

On the Minimum Edge-Density of 5-Critical Triangle-Free Graphs.
Electron. Notes Discret. Math., 2015

2014
Pebbling Graphs of Fixed Diameter.
J. Graph Theory, 2014

2013
Sub-exponentially many 3-colorings of triangle-free planar graphs.
J. Comb. Theory, Ser. B, 2013

2012
Five-coloring graphs on the Klein bottle.
J. Comb. Theory, Ser. B, 2012

2011
Minor-minimal non-projective planar graphs with an internal 3-separation.
Electron. Notes Discret. Math., 2011

Decomposing infinite matroids into their 3-connected minors.
Electron. Notes Discret. Math., 2011

2009
Pebbling Graphs of Diameter Three and Four.
Electron. Notes Discret. Math., 2009

Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs.
Electron. Notes Discret. Math., 2009

2008
Six-Critical Graphs on the Klein Bottle.
Electron. Notes Discret. Math., 2008


  Loading...