Luke Postle

Comb., June, 2023

On the Density of Critical Graphs with No Large Cliques.

[BibT_eX]

[DOI]

Comb., February, 2023

Connectivity and choosability of graphs with no Kt minor.

[BibT_eX]

[DOI]

Sergey Norin

J. Comb. Theory B, 2023

Local Hadwiger's Conjecture.

[BibT_eX]

[DOI]

Benjamin R. Moore

Lise Turner

J. Comb. Theory B, 2023

2022

On Decidability of Hyperbolicity.

[BibT_eX]

[DOI]

Comb., December, 2022

Asymptotically good edge correspondence colourings.

[BibT_eX]

[DOI]

Michael Molloy

J. Graph Theory, 2022

Structure in sparse k-critical graphs.

[BibT_eX]

[DOI]

Ronald J. Gould

Victor Larsen

J. Comb. Theory B, 2022

Triangle-free planar graphs with at most 64n0.731 3-colorings.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

Colouring graphs with sparse neighbourhoods: Bounds and applications.

[BibT_eX]

[DOI]

Marthe Bonamy

Thomas Perrett

J. Comb. Theory B, 2022

Bounding χ by a fraction of Δ for graphs without large cliques.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

The chromatic number of triangle-free hypergraphs.

[BibT_eX]

[DOI]

Lina Li

CoRR, 2022

On the Density of C7-Critical Graphs.

[BibT_eX]

[DOI]

Evelyne Smith-Roberge

Comb., 2022

2021

The list linear arboricity of graphs.

[BibT_eX]

[DOI]

Ringi Kim

J. Graph Theory, 2021

3-List-coloring graphs of girth at least five on surfaces.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Corrigendum to "A local epsilon version of Reed's Conjecture" [J. Combin. Theory Ser. B 141 (2020) 181-222].

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Progress towards Nash-Williams' conjecture on triangle decompositions.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

Bounding the number of cycles in a graph in terms of its degree sequence.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

Reducing Linear Hadwiger's Conjecture to Coloring Small Graphs.

[BibT_eX]

[DOI]

CoRR, 2021

2019

Bounded diameter arboricity.

[BibT_eX]

[DOI]

Martin Merker

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.

[BibT_eX]

[DOI]

Maxime Faron

J. Graph Theory, 2019

List coloring with requests.

[BibT_eX]

[DOI]

Sergey Norin

J. Graph Theory, 2019

Planar graphs of girth at least five are square (Δ + 2)-choosable.

[BibT_eX]

[DOI]

Marthe Bonamy

Daniel W. Cranston

J. Comb. Theory B, 2019

Improved Bounds for Randomly Sampling Colorings via Linear Programming.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

Five-list-coloring graphs on surfaces III. One list of size one and one list of size two.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

Characterizing 4-critical graphs with Ore-degree at most seven.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

Chromatic index determined by fractional chromatic index.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

Random 4-regular graphs have 3-star decompositions asymptotically almost surely.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Reconstruction of infinite matroids from their 3-connected minors.

[BibT_eX]

[DOI]

Nathan J. Bowler

Johannes Carmesin

Eur. J. Comb., 2018

Fractional coloring with local demands.

[BibT_eX]

[DOI]

CoRR, 2018

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

[BibT_eX]

[DOI]

Guillem Perarnau

CoRR, 2018

2017

On the Minimum Edge-Density of 4-Critical Graphs of Girth Five.

[BibT_eX]

[DOI]

Chun-Hung Liu

J. Graph Theory, 2017

5-list-coloring planar graphs with distant precolored vertices.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Modified linear programming and class 0 bounds for graph pebbling.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

A Local Epsilon Version of Reed's Conjecture.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

On the List Coloring Version of Reed's Conjecture.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

On Star Decompositions of Random Regular Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

On the minimum number of edges in triangle-free 5-critical graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Density of 5/2-critical graphs.

[BibT_eX]

[DOI]

Comb., 2017

2016

Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

The structure of 2-separations of infinite matroids.

[BibT_eX]

[DOI]

Elad Aigner-Horev

Reinhard Diestel

J. Comb. Theory B, 2016

Hyperbolic families and coloring graphs on surfaces.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

On the Minimum Edge-Density of 5-Critical Triangle-Free Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

2014

Pebbling Graphs of Fixed Diameter.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

2013

Sub-exponentially many 3-colorings of triangle-free planar graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

2012

Five-coloring graphs on the Klein bottle.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2012

2011

Minor-minimal non-projective planar graphs with an internal 3-separation.

[BibT_eX]

[DOI]

Arash Asadi

Electron. Notes Discret. Math., 2011

Decomposing infinite matroids into their 3-connected minors.

[BibT_eX]

[DOI]

Elad Aigner-Horev

Reinhard Diestel

Electron. Notes Discret. Math., 2011

2009

Pebbling Graphs of Diameter Three and Four.

[BibT_eX]

[DOI]

Noah Streib

Carl Yerger

Electron. Notes Discret. Math., 2009

Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs.

[BibT_eX]

[DOI]

Arash Asadi