The following pages link to Luke Postle (Q273166):
Displayed 50 items.
- Five-list-coloring graphs on surfaces. II: A linear bound for critical graphs in a disk. (Q273167) (← links)
- On the minimum edge-density of 5-critical triangle-free graphs (Q322349) (← links)
- 5-list-coloring planar graphs with distant precolored vertices (Q345086) (← links)
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 (Q684119) (← links)
- Characterizing 4-critical graphs with Ore-degree at most seven (Q684124) (← links)
- Five-coloring graphs on the Klein bottle (Q713974) (← links)
- The structure of 2-separations of infinite matroids (Q895994) (← links)
- Planar graphs of girth at least five are square \((\delta + 2)\)-choosable (Q1633752) (← links)
- Random 4-regular graphs have 3-star decompositions asymptotically almost surely (Q1645062) (← links)
- Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two (Q1682205) (← links)
- On star decompositions of random regular graphs (Q1689938) (← links)
- On the list coloring version of Reed's conjecture (Q1689939) (← links)
- Density of 5/2-critical graphs (Q1705839) (← links)
- Chromatic index determined by fractional chromatic index (Q1748268) (← links)
- Corrigendum to: ``A local epsilon version of Reed's conjecture'' (Q1984533) (← links)
- Connectivity and choosability of graphs with no \(K_t\) minor (Q2099418) (← links)
- Colouring graphs with sparse neighbourhoods: bounds and applications (Q2131867) (← links)
- On the density of \(C_7\)-critical graphs (Q2151187) (← links)
- Progress towards Nash-Williams' conjecture on triangle decompositions (Q2221932) (← links)
- 3-list-coloring graphs of girth at least five on surfaces (Q2222041) (← links)
- Bounding the number of cycles in a graph in terms of its degree sequence (Q2225410) (← links)
- Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs (Q2259863) (← links)
- On the minimum number of edges in triangle-free 5-critical graphs (Q2403700) (← links)
- Reconstruction of infinite matroids from their 3-connected minors (Q2408971) (← links)
- Modified linear programming and class 0 bounds for graph pebbling (Q2410032) (← links)
- Structure in sparse \(k\)-critical graphs (Q2673484) (← links)
- Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings (Q2673487) (← links)
- Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor (Q2700634) (← links)
- Pebbling Graphs of Diameter Three and Four (Q2851433) (← links)
- Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs (Q2851443) (← links)
- (Q2857312) (← links)
- (Q2857321) (← links)
- Hyperbolic families and coloring graphs on surfaces (Q4560169) (← links)
- On the Minimum Edge‐Density of 4‐Critical Graphs of Girth Five (Q4596323) (← links)
- Exponentially many 4‐list‐colorings of triangle‐free graphs on surfaces (Q4604028) (← links)
- Bounded diameter arboricity (Q4632026) (← links)
- Pebbling Graphs of Diameter Three and Four (Q4916099) (← links)
- List coloring with requests (Q5207462) (← links)
- On the clique number of the square of a line graph and its relation to maximum degree of the line graph (Q5207468) (← links)
- Improved Bounds for Randomly Sampling Colorings via Linear Programming (Q5236321) (← links)
- Six-Critical Graphs on the Klein Bottle (Q5301014) (← links)
- Pebbling Graphs of Fixed Diameter (Q5417824) (← links)
- A local epsilon version of Reed's conjecture (Q5919302) (← links)
- The list linear arboricity of graphs (Q6056776) (← links)
- On the density of critical graphs with no large cliques (Q6057484) (← links)
- An improved bound for the linear arboricity conjecture (Q6081382) (← links)
- Asymptotically good edge correspondence colourings (Q6081556) (← links)
- Local Hadwiger's conjecture (Q6170795) (← links)
- Edge-colouring graphs with local list sizes (Q6187343) (← links)
- On the clique number of the square of a line graph and its relation to Ore-degree (Q6289879) (← links)