Ross J. Kang

Random Struct. Algorithms, January, 2024

When removing an independent set is optimal for reducing the chromatic number.

[BibT_eX]

[DOI]

John Haslegrave

Eur. J. Comb., January, 2024

A Precise Condition for Independent Transversals in Bipartite Covers.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2024

List packing number of bounded degree graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2024

Reconfiguration of Independent Transversals.

[BibT_eX]

[DOI]

Pjotr Buys

Kenta Ozeki

CoRR, 2024

2023

Regular Turán numbers and some Gan-Loh-Sudakov-type problems.

[BibT_eX]

[DOI]

J. Graph Theory, 2023

The χ-binding function of d-directional segment graphs.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Maximizing Line Subgraphs of Diameter at Most t.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2022

Colorings, transversals, and local sparsity.

[BibT_eX]

[DOI]

Tom Kelly

Random Struct. Algorithms, 2022

Strong chromatic index and Hadwiger number.

[BibT_eX]

[DOI]

J. Graph Theory, 2022

2021

Single-conflict colouring.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Occupancy fraction, fractional colouring, and triangle fraction.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Packing list-colourings.

[BibT_eX]

[DOI]

CoRR, 2021

Structure and Colour in Triangle-Free Graphs.

[BibT_eX]

[DOI]

N. R. Aravind

Viresh Patel

Electron. J. Comb., 2021

An improved procedure for colouring graphs of bounded local density.

[BibT_eX]

[DOI]

Eoin Hurley

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Coloring triangle-free graphs with local list sizes.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2020

An algorithmic framework for colouring locally sparse graphs.

[BibT_eX]

[DOI]

CoRR, 2020

Bipartite Induced Density in Triangle-Free Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

2019

A precolouring extension of Vizing's theorem.

[BibT_eX]

[DOI]

António Girão

J. Graph Theory, 2019

Separation Choosability and Dense Bipartite Induced Subgraphs.

[BibT_eX]

[DOI]

Louis Esperet

Stéphan Thomassé

Comb. Probab. Comput., 2019

Tree-Like Distance Colouring for Planar Graphs of Sufficient Girth.

[BibT_eX]

[DOI]

Willem van Loon

Electron. J. Comb., 2019

VC Dimension and a Union Theorem for Set Systems.

[BibT_eX]

[DOI]

António Girão

Electron. J. Comb., 2019

Approximate Strong Edge-Colouring of Unit Disk Graphs.

[BibT_eX]

[DOI]

Nicolas Grelier

Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019

2018

Packing Graphs of Bounded Codegree.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2018

Colouring triangle-free graphs with local list sizes.

[BibT_eX]

[DOI]

CoRR, 2018

Least conflict choosability.

[BibT_eX]

[DOI]

CoRR, 2018

Extension from Precoloured Sets of Edges.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

2017

List Coloring with a Bounded Palette.

[BibT_eX]

[DOI]

Marthe Bonamy

J. Graph Theory, 2017

Colouring squares of claw-free graphs.

[BibT_eX]

[DOI]

Lucas Pastor

Electron. Notes Discret. Math., 2017

Distance colouring without one cycle length.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Packing two graphs of even girth 10.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

2016

Coloring Powers and Girth.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Squared chromatic and stability numbers without claws or large cliques.

[BibT_eX]

[DOI]

CoRR, 2016

2015

A Precise Threshold for Quasi-Ramsey Numbers.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

On a Ramsey-type problem of Erdős and Pach.

[BibT_eX]

[DOI]

Viresh Patel

Guus Regts

Electron. Notes Discret. Math., 2015

Decomposition of bounded degree graphs into C4-free subgraphs.

[BibT_eX]

[DOI]

Guillem Perarnau

Eur. J. Comb., 2015

On r-dynamic coloring of grids.

[BibT_eX]

[DOI]

Douglas B. West

Discret. Appl. Math., 2015

2014

For most graphs H, most H-free graphs have a linear homogeneous set.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2014

Supersaturation in the Boolean Lattice.

[BibT_eX]

[DOI]

Andrew P. Dove

Jerrold R. Griggs

Integers, 2014

Arrangements of Pseudocircles and Circles.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

The Distance-t Chromatic Index of Graphs.

[BibT_eX]

[DOI]

Tomás Kaiser

Comb. Probab. Comput., 2014

Subset Glauber Dynamics on Graphs, Hypergraphs and Matroids of Bounded Tree-Width.

[BibT_eX]

[DOI]

Magnus Bordewich

Electron. J. Comb., 2014

2013

Improper Choosability and Property B.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

2012

Induced Matchings in Subcubic Planar Graphs.

[BibT_eX]

[DOI]

Matthias Mnich

SIAM J. Discret. Math., 2012

Sphere and Dot Product Representations of Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2012

Distance edge-colourings and matchings.

[BibT_eX]

[DOI]

Putra Manggala

Discret. Appl. Math., 2012

2011

Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-Coloring.

[BibT_eX]

[DOI]

Matej Stehlík

SIAM J. Discret. Math., 2011

Largest sparse subgraphs of random graphs.

[BibT_eX]

[DOI]

Nikolaos Fountoulakis

Colin McDiarmid

Electron. Notes Discret. Math., 2011

Frugal, acyclic and star colourings of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Dot Product Representations of Planar Graphs.

[BibT_eX]

[DOI]

László Lovász

Edward R. Scheinerman

Electron. J. Comb., 2011

Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width.

[BibT_eX]

[DOI]

Magnus Bordewich

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

Acyclic dominating partitions.

[BibT_eX]

[DOI]

Louigi Addario-Berry

J. Graph Theory, 2010

Acyclic improper colourings of graphs with bounded maximum degree.

[BibT_eX]

[DOI]

Louigi Addario-Berry

Louis Esperet

Colin J. H. McDiarmid

Alexandre Pinlou

Discret. Math., 2010

The t-Improper Chromatic Number of Random Graphs.

[BibT_eX]

[DOI]

Colin McDiarmid

Comb. Probab. Comput., 2010

The t-Stability Number of a Random Graph.

[BibT_eX]

[DOI]

Nikolaos Fountoulakis

Colin McDiarmid

Electron. J. Comb., 2010

Dot Product Representations of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 18th International Symposium, 2010

2009

Improper coloring of unit disk graphs.

[BibT_eX]

[DOI]

Frédéric Havet

Networks, 2009

Circular choosability.

[BibT_eX]

[DOI]

Frédéric Havet

J. Graph Theory, 2009

Acyclic and Frugal Colourings of Graphs.

[BibT_eX]

[DOI]

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008

Improper colourings of graphs.

[BibT_eX]

[DOI]

PhD thesis, 2008

Improper colouring of (random) unit disk graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

2007

The t-improper chromatic number of random graphs.

[BibT_eX]

[DOI]

Colin J. H. McDiarmid

Electron. Notes Discret. Math., 2007

Acyclic dominating partitions.

[BibT_eX]

[DOI]

Louigi Addario-Berry

Electron. Notes Discret. Math., 2007

2005

Improper Colourings of Unit Disk Graphs.

[BibT_eX]

[DOI]

Frédéric Havet