default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuke Postle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j52]Tom Kelly
, Luke Postle:
Improving the Caro-Wei bound and applications to Turán stability. Discret. Appl. Math. 358: 33-43 (2024)- [j51]Marthe Bonamy, Michelle Delcourt, Richard Lang, Luke Postle:
Edge-colouring graphs with local list sizes. J. Comb. Theory B 165: 68-96 (2024) - [j50]Tom Kelly, Luke Postle:
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number. J. Comb. Theory B 169: 298-337 (2024) - 2023
- [j49]Tom Kelly, Luke Postle:
On the Density of Critical Graphs with No Large Cliques. Comb. 43(1): 57-89 (2023) - [j48]Richard Lang, Luke Postle:
An Improved Bound for the Linear Arboricity Conjecture. Comb. 43(3): 547-569 (2023) - [j47]Sergey Norin, Luke Postle:
Connectivity and choosability of graphs with no Kt minor. J. Comb. Theory B 158(Part): 283-300 (2023) - [j46]Benjamin R. Moore, Luke Postle, Lise Turner:
Local Hadwiger's Conjecture. J. Comb. Theory B 162: 154-183 (2023) - 2022
- [j45]Luke Postle, Evelyne Smith-Roberge:
On the Density of C7-Critical Graphs. Comb. 42(2): 253-300 (2022) - [j44]Zdenek Dvorák, Luke Postle:
On Decidability of Hyperbolicity. Comb. 42(6): 1081-1098 (2022) - [j43]Marthe Bonamy, Thomas Perrett, Luke Postle:
Colouring graphs with sparse neighbourhoods: Bounds and applications. J. Comb. Theory B 155: 278-317 (2022) - [j42]Ronald J. Gould, Victor Larsen, Luke Postle:
Structure in sparse k-critical graphs. J. Comb. Theory B 156: 194-222 (2022) - [j41]Zdenek Dvorák, Luke Postle:
Triangle-free planar graphs with at most 64n0.731 3-colorings. J. Comb. Theory B 156: 294-298 (2022) - [j40]Marthe Bonamy, Tom Kelly, Peter Nelson, Luke Postle:
Bounding χ by a fraction of Δ for graphs without large cliques. J. Comb. Theory B 157: 263-282 (2022) - [j39]Michael Molloy, Luke Postle:
Asymptotically good edge correspondence colourings. J. Graph Theory 100(3): 559-577 (2022) - [i15]Lina Li, Luke Postle:
The chromatic number of triangle-free hypergraphs. CoRR abs/2202.02839 (2022) - [i14]Benjamin R. Moore, Luke Postle, Lise Turner:
Local Hadwiger's Conjecture. CoRR abs/2203.06718 (2022) - 2021
- [j38]Zdenek Dvorák, Natasha Morrison, Jonathan A. Noel, Sergey Norin, Luke Postle:
Bounding the number of cycles in a graph in terms of its degree sequence. Eur. J. Comb. 91: 103206 (2021) - [j37]Michelle Delcourt, Luke Postle:
Progress towards Nash-Williams' conjecture on triangle decompositions. J. Comb. Theory B 146: 382-416 (2021) - [j36]Luke Postle:
3-List-coloring graphs of girth at least five on surfaces. J. Comb. Theory B 147: 1-36 (2021) - [j35]Tom Kelly, Luke Postle:
Corrigendum to "A local epsilon version of Reed's Conjecture" [J. Combin. Theory Ser. B 141 (2020) 181-222]. J. Comb. Theory B 151: 509-512 (2021) - [j34]Ringi Kim, Luke Postle:
The list linear arboricity of graphs. J. Graph Theory 98(1): 125-140 (2021) - [i13]Michelle Delcourt, Luke Postle:
Reducing Linear Hadwiger's Conjecture to Coloring Small Graphs. CoRR abs/2108.01633 (2021) - 2020
- [j33]Tom Kelly, Luke Postle:
A local epsilon version of Reed's Conjecture. J. Comb. Theory B 141: 181-222 (2020) - [i12]Zdenek Dvorák, Luke Postle:
On decidability of hyperbolicity. CoRR abs/2010.01634 (2020)
2010 – 2019
- 2019
- [j32]Marthe Bonamy, Daniel W. Cranston, Luke Postle:
Planar graphs of girth at least five are square (Δ + 2)-choosable. J. Comb. Theory B 134: 218-238 (2019) - [j31]Martin Merker, Luke Postle:
Bounded diameter arboricity. J. Graph Theory 90(4): 629-641 (2019) - [j30]Zdenek Dvorák, Sergey Norin, Luke Postle:
List coloring with requests. J. Graph Theory 92(3): 191-206 (2019) - [j29]Maxime Faron, Luke Postle:
On the clique number of the square of a line graph and its relation to maximum degree of the line graph. J. Graph Theory 92(3): 261-274 (2019) - [c2]Luke Postle:
Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces. FOCS 2019: 929-941 - [c1]Sitan Chen, Michelle Delcourt, Ankur Moitra, Guillem Perarnau, Luke Postle:
Improved Bounds for Randomly Sampling Colorings via Linear Programming. SODA 2019: 2216-2234 - [i11]Luke Postle:
Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces. CoRR abs/1904.03723 (2019) - [i10]Tom Kelly, Luke Postle:
On the density of critical graphs with no large cliques. CoRR abs/1911.02661 (2019) - [i9]Tom Kelly, Luke Postle:
A local epsilon version of Reed's Conjecture. CoRR abs/1911.02672 (2019) - 2018
- [j28]Nathan J. Bowler, Johannes Carmesin, Luke Postle:
Reconstruction of infinite matroids from their 3-connected minors. Eur. J. Comb. 67: 126-144 (2018) - [j27]Michelle Delcourt, Luke Postle:
Random 4-regular graphs have 3-star decompositions asymptotically almost surely. Eur. J. Comb. 72: 97-111 (2018) - [j26]Luke Postle, Robin Thomas:
Five-list-coloring graphs on surfaces III. One list of size one and one list of size two. J. Comb. Theory B 128: 1-16 (2018) - [j25]Zdenek Dvorák, Luke Postle:
Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8. J. Comb. Theory B 129: 38-54 (2018) - [j24]Luke Postle:
Characterizing 4-critical graphs with Ore-degree at most seven. J. Comb. Theory B 129: 107-147 (2018) - [j23]Guantao Chen, Yuping Gao, Ringi Kim, Luke Postle, Songling Shan:
Chromatic index determined by fractional chromatic index. J. Comb. Theory B 131: 85-108 (2018) - [j22]Tom Kelly, Luke Postle:
Exponentially many 4-list-colorings of triangle-free graphs on surfaces. J. Graph Theory 87(2): 230-238 (2018) - [i8]Michelle Delcourt, Guillem Perarnau, Luke Postle:
Rapid mixing of Glauber dynamics for colorings below Vigoda's 11/6 threshold. CoRR abs/1804.04025 (2018) - [i7]Marthe Bonamy, Thomas Perrett, Luke Postle:
Colouring Graphs with Sparse Neighbourhoods: Bounds and Applications. CoRR abs/1810.06704 (2018) - [i6]Sitan Chen, Michelle Delcourt, Ankur Moitra, Guillem Perarnau, Luke Postle:
Improved Bounds for Randomly Sampling Colorings via Linear Programming. CoRR abs/1810.12980 (2018) - [i5]Tom Kelly, Luke Postle:
Fractional coloring with local demands. CoRR abs/1811.11806 (2018) - 2017
- [j21]Zdenek Dvorák, Luke Postle:
Density of 5/2-critical graphs. Comb. 37(5): 863-886 (2017) - [j20]Luke Postle:
On the minimum number of edges in triangle-free 5-critical graphs. Eur. J. Comb. 66: 264-280 (2017) - [j19]Michelle Delcourt, Luke Postle:
On Star Decompositions of Random Regular Graphs. Electron. Notes Discret. Math. 61: 339-342 (2017) - [j18]Michelle Delcourt, Luke Postle:
On the List Coloring Version of Reed's Conjecture. Electron. Notes Discret. Math. 61: 343-349 (2017) - [j17]Tom Kelly, Luke Postle:
A Local Epsilon Version of Reed's Conjecture. Electron. Notes Discret. Math. 61: 719-725 (2017) - [j16]Daniel W. Cranston, Luke Postle, Chenxiao Xue, Carl Yerger:
Modified linear programming and class 0 bounds for graph pebbling. J. Comb. Optim. 34(1): 114-132 (2017) - [j15]Zdenek Dvorák, Bernard Lidický, Bojan Mohar, Luke Postle:
5-list-coloring planar graphs with distant precolored vertices. J. Comb. Theory B 122: 311-352 (2017) - [j14]Chun-Hung Liu, Luke Postle:
On the Minimum Edge-Density of 4-Critical Graphs of Girth Five. J. Graph Theory 86(4): 387-405 (2017) - 2016
- [j13]Elad Aigner-Horev, Reinhard Diestel, Luke Postle:
The structure of 2-separations of infinite matroids. J. Comb. Theory B 116: 25-56 (2016) - [j12]Luke Postle, Robin Thomas:
Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk. J. Comb. Theory B 119: 42-65 (2016) - [i4]Luke Postle, Robin Thomas:
Hyperbolic families and coloring graphs on surfaces. CoRR abs/1609.06749 (2016) - 2015
- [j11]Luke Postle:
On the Minimum Edge-Density of 5-Critical Triangle-Free Graphs. Electron. Notes Discret. Math. 49: 667-673 (2015) - [j10]Luke Postle, Robin Thomas:
Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs. J. Comb. Theory B 111: 234-241 (2015) - [i3]Luke Postle, Robin Thomas:
Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk. CoRR abs/1505.05927 (2015) - 2014
- [j9]Luke Postle:
Pebbling Graphs of Fixed Diameter. J. Graph Theory 75(4): 302-310 (2014) - [i2]Luke Postle, Robin Thomas:
Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs. CoRR abs/1402.1813 (2014) - 2013
- [j8]Arash Asadi, Zdenek Dvorák, Luke Postle, Robin Thomas:
Sub-exponentially many 3-colorings of triangle-free planar graphs. J. Comb. Theory B 103(6): 706-712 (2013) - [j7]Luke Postle, Noah Streib, Carl Yerger:
Pebbling Graphs of Diameter Three and Four. J. Graph Theory 72(4): 398-417 (2013) - 2012
- [j6]Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger:
Five-coloring graphs on the Klein bottle. J. Comb. Theory B 102(5): 1067-1098 (2012) - [i1]Zdenek Dvorák, Bernard Lidický, Bojan Mohar, Luke Postle:
5-list-coloring planar graphs with distant precolored vertices. CoRR abs/1209.0366 (2012) - 2011
- [j5]Elad Aigner-Horev, Reinhard Diestel, Luke Postle:
Decomposing infinite matroids into their 3-connected minors. Electron. Notes Discret. Math. 38: 11-16 (2011) - [j4]Arash Asadi, Luke Postle, Robin Thomas:
Minor-minimal non-projective planar graphs with an internal 3-separation. Electron. Notes Discret. Math. 38: 69-75 (2011)
2000 – 2009
- 2009
- [j3]Luke Postle, Noah Streib, Carl Yerger:
Pebbling Graphs of Diameter Three and Four. Electron. Notes Discret. Math. 34: 21-28 (2009) - [j2]Arash Asadi, Luke Postle, Robin Thomas:
Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs. Electron. Notes Discret. Math. 34: 81-87 (2009) - 2008
- [j1]Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger, Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický:
Six-Critical Graphs on the Klein Bottle. Electron. Notes Discret. Math. 31: 235-240 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
