Marthe Bonamy

Marc Heinrich

Clément Legrand-Duchesne

Jonathan Narboni

J. Comb. Theory B, January, 2024

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2024

Kempe changes in degenerate graphs.

[BibT_eX]

[DOI]

Vincent Delecroix

Clément Legrand-Duchesne

Eur. J. Comb., 2024

2023

Partitioning edges of a planar graph into linear forests and a matching.

[BibT_eX]

[DOI]

J. Graph Theory, November, 2023

Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$-choosable.

[BibT_eX]

[DOI]

Théo Pierron

Éric Sopena

J. Graph Theory, September, 2023

Forty years of history.

[BibT_eX]

[DOI]

Patrice Ossona de Mendez

Éric Colin de Verdière

Mathilde Bouvel

Eur. J. Comb., June, 2023

On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph.

[BibT_eX]

[DOI]

Jean-Sébastien Sereni

Richard Weber

Math. Oper. Res., May, 2023

On Vizing's edge colouring question.

[BibT_eX]

[DOI]

J. Comb. Theory B, March, 2023

Separating the edges of a graph by a linear number of paths.

[BibT_eX]

[DOI]

CoRR, 2023

Improved Pyrotechnics: Closer to the Burning Number Conjecture.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

Exploring the Space of Colourings with Kempe Changes (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

Shorter Labeling Schemes for Planar Graphs.

[BibT_eX]

[DOI]

Cyril Gavoille

SIAM J. Discret. Math., September, 2022

Colouring graphs with sparse neighbourhoods: Bounds and applications.

[BibT_eX]

[DOI]

Thomas Perrett

Luke Postle

J. Comb. Theory B, 2022

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

Degeneracy of Pt-free and C⩾t-free graphs with no large complete bipartite subgraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

Tuza's Conjecture for Threshold Graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2022

2021

Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs.

[BibT_eX]

[DOI]

J. ACM, 2021

The interactive sum choice number of graphs.

[BibT_eX]

[DOI]

Kitty Meeks

Discret. Appl. Math., 2021

A note on connected greedy edge colouring.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Dominating sets reconfiguration under token sliding.

[BibT_eX]

[DOI]

Paul Dorbec

Paul Ouvrard

Discret. Appl. Math., 2021

A note on deterministic zombies.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Frozen (Δ + 1)-colourings of bounded degree graphs.

[BibT_eX]

[DOI]

Guillem Perarnau

Comb. Probab. Comput., 2021

Improved pyrotechnics : Closer to the burning graph conjecture.

[BibT_eX]

[DOI]

CoRR, 2021

Jones' Conjecture in Subcubic Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy.

[BibT_eX]

[DOI]

Algorithmica, 2021

A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Optimal labelling schemes for adjacency, comparability, and reachability.

[BibT_eX]

[DOI]

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Decomposing the edges of a graph into simpler structures.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics, 2021

2020

Diameter of colorings under Kempe changes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

Partitioning the vertices of a torus into isomorphic subgraphs.

[BibT_eX]

[DOI]

Natasha Morrison

Alex Scott

J. Comb. Theory A, 2020

Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces.

[BibT_eX]

[DOI]

CoRR, 2020

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets.

[BibT_eX]

[DOI]

CoRR, 2020

On the effect of symmetry requirement for rendezvous on the complete graph.

[BibT_eX]

[DOI]

Jean-Sébastien Sereni

CoRR, 2020

Avoidable Paths in Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

Revisiting a Theorem by Folkman on Graph Colouring.

[BibT_eX]

[DOI]

Jean-Sébastien Sereni

Electron. J. Comb., 2020

Shortest Reconfiguration of Colorings Under Kempe Changes.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Limiting Crossing Numbers for Geodesic Drawings on the Sphere.

[BibT_eX]

[DOI]

Bojan Mohar

Alexandra Wesolek

Proceedings of the Graph Drawing and Network Visualization - 28th International Symposium, 2020

2019

Tight Lower Bounds for the Complexity of Multicoloring.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2019

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

[BibT_eX]

[DOI]

Daniel W. Cranston

Luke Postle

J. Comb. Theory B, 2019

On a conjecture of Mohar concerning Kempe equivalence of regular graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Gallai's path decomposition conjecture for graphs of small maximum degree.

[BibT_eX]

[DOI]

Thomas J. Perrett

Discret. Math., 2019

Jones' Conjecture in subcubic graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Graphs of bounded cliquewidth are polynomially χ-bounded.

[BibT_eX]

[DOI]

CoRR, 2019

Every planar graph with Δ≥8 is totally (Δ+2)-choosable.

[BibT_eX]

[DOI]

Théo Pierron

Éric Sopena

CoRR, 2019

Distributed Coloring in Sparse Graphs with Fewer Colors.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

Independent Feedback Vertex Set for P5-Free Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2019

Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Enumerating Minimal Dominating Sets in Triangle-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

The Perfect Matching Reconfiguration Problem.

[BibT_eX]

[DOI]

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

2018

Independent feedback vertex sets for graphs of bounded diameter.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

Frozen colourings of bounded degree graphs.

[BibT_eX]

[DOI]

Guillem Perarnau

Electron. Notes Discret. Math., 2018

Recoloring graphs via tree decompositions.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

On Directed Feedback Vertex Set Parameterized by Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

Distributed Recoloring.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

EPTAS for Max Clique on Disks and Unit Balls.

[BibT_eX]

[DOI]

Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017

On the Neighbor Sum Distinguishing Index of Planar Graphs.

[BibT_eX]

[DOI]

Jakub Przybylo

J. Graph Theory, 2017

List Coloring with a Bounded Palette.

[BibT_eX]

[DOI]

Ross J. Kang

J. Graph Theory, 2017

Incidence coloring of graphs with high maximum average degree.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

On the difference between the Szeged and the Wiener index.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2017

Linear Kernels for Outbranching Problems in Sparse Digraphs.

[BibT_eX]

[DOI]

Algorithmica, 2017

Token Sliding on Chordal Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

Recognizing Graphs Close to Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Independent Feedback Vertex Set for P_5-free Graphs.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016

A 13k-kernel for planar feedback vertex set via region decomposition.

[BibT_eX]

[DOI]

Lukasz Kowalik

Theor. Comput. Sci., 2016

The Erdös-Hajnal Conjecture for Long Holes and Antiholes.

[BibT_eX]

[DOI]

Stéphan Thomassé

SIAM J. Discret. Math., 2016

Planar graphs with Δ≥7 and no triangle adjacent to a C4 are minimally edge and total choosable.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2016

2015

Global discharging methods for coloring problems in graphs. (Méthodes de déchargement global pour des problèmes de coloration dans les graphes).

[BibT_eX]

[DOI]

PhD thesis, 2015

Planar graphs with Δ ≥ 8 are (Δ+1)-edge-choosable.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Strong edge coloring sparse graphs.

[BibT_eX]

[DOI]

Julien Bensmail

Hervé Hocquard

Electron. Notes Discret. Math., 2015

2014

2-Distance Coloring of Sparse Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

List coloring the square of sparse graphs with large degree.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable.

[BibT_eX]

[DOI]

Discret. Math., 2014

Brooks' theorem on powers of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2014

On the neighbour sum distinguishing index of planar graphs.

[BibT_eX]

[DOI]

Jakub Przybylo

CoRR, 2014

Planar graphs with $Δ\geq 7$ and no triangle adjacent to a C4 are minimally edge and total choosable.

[BibT_eX]

[DOI]

CoRR, 2014

Graphs with large chromatic number induce $3k$-cycles.

[BibT_eX]

[DOI]

Pierre Charbit

Stéphan Thomassé

CoRR, 2014

The Erdős-Hajnal Conjecture for Long Holes and Anti-holes.

[BibT_eX]

[DOI]

Stéphan Thomassé

CoRR, 2014

Reconfiguring Independent Sets in Cographs.

[BibT_eX]

[DOI]

CoRR, 2014

A 14k -Kernel for Planar Feedback Vertex Set via Region Decomposition.

[BibT_eX]

[DOI]

Lukasz Kowalik

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

2013

Recoloring bounded treewidth graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable

[BibT_eX]

[DOI]

CoRR, 2013

Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable

[BibT_eX]

[DOI]