Louis Esperet

Ugo Giocanti

Discret. Math., April, 2024

2023

Distributed coloring and the local structure of unit-disk graphs.

[BibT_eX]

[DOI]

Sébastien Julliot

Arnaud de Mesmay

Theor. Comput. Sci., 2023

Local certification of geometric graph classes.

[BibT_eX]

[DOI]

CoRR, 2023

The structure of quasi-transitive graphs avoiding a minor with applications to the domino problem.

[BibT_eX]

[DOI]

Ugo Giocanti

Clément Legrand-Duchesne

CoRR, 2023

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

[BibT_eX]

[DOI]

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

Optimal Adjacency Labels for Subgraphs of Cartesian Products.

[BibT_eX]

[DOI]

Nathaniel Harms

Viktor Zamaraev

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Proof of the Clustered Hadwiger Conjecture.

[BibT_eX]

[DOI]

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Local certification of graphs on surfaces.

[BibT_eX]

[DOI]

Benjamin Lévêque

Theor. Comput. Sci., 2022

Local boxicity.

[BibT_eX]

[DOI]

Lyuben Lichev

Eur. J. Comb., 2022

Clustered 3-colouring graphs of bounded degree.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2022

Testability and Local Certification of Monotone Properties in Minor-Closed Classes.

[BibT_eX]

[DOI]

Sergey Norin

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Sketching Distances in Monotone Graph Classes.

[BibT_eX]

[DOI]

Nathaniel Harms

Andrey Kupavskii

Proceedings of the Approximation, 2022

2021

Isometric Universal Graphs.

[BibT_eX]

[DOI]

Wouter Cames van Batenburg

Cyril Gavoille

Carla Groenland

SIAM J. Discret. Math., 2021

Single-conflict colouring.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Adjacency Labelling for Planar Graphs (and Beyond).

[BibT_eX]

[DOI]

J. ACM, 2021

Packing and Covering Balls in Graphs Excluding a Minor.

[BibT_eX]

[DOI]

Nicolas Bousquet

Comb., 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

Distributed Algorithms for Fractional Coloring.

[BibT_eX]

[DOI]

Nicolas Bousquet

François Pirot

Proceedings of the Structural Information and Communication Complexity, 2021

2020

Local approximation of the Maximum Cut in regular graphs.

[BibT_eX]

[DOI]

Étienne Bamas

Theor. Comput. Sci., 2020

Bipartite complements of circle graphs.

[BibT_eX]

[DOI]

Matej Stehlík

Discret. Math., 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

Sparse universal graphs for planarity.

[BibT_eX]

[DOI]

Pat Morin

CoRR, 2020

2019

Improper coloring of graphs on surfaces.

[BibT_eX]

[DOI]

Ilkyoo Choi

J. Graph Theory, 2019

Separation Choosability and Dense Bipartite Induced Subgraphs.

[BibT_eX]

[DOI]

Ross J. Kang

Stéphan Thomassé

Comb. Probab. Comput., 2019

Exact Distance Colouring in Trees.

[BibT_eX]

[DOI]

Nicolas Bousquet

Rémi de Joannis de Verclos

Ararat Harutyunyan

Comb. Probab. Comput., 2019

Planar graphs have bounded nonrepetitive chromatic number.

[BibT_eX]

[DOI]

CoRR, 2019

Distributed Coloring in Sparse Graphs with Fewer Colors.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

Distributed Coloring of Graphs with an Optimal Number of Colors.

[BibT_eX]

[DOI]

Étienne Bamas

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

2018

The width of quadrangulations of the projective plane.

[BibT_eX]

[DOI]

Matej Stehlík

J. Graph Theory, 2018

Polynomial expansion and sublinear separators.

[BibT_eX]

[DOI]

Jean-Florent Raymond

Eur. J. Comb., 2018

Least conflict choosability.

[BibT_eX]

[DOI]

CoRR, 2018

Boxicity, Poset Dimension, and Excluded Minors.

[BibT_eX]

[DOI]

Wouter Cames van Batenburg

Veit Wiechert

Electron. J. Comb., 2018

2017

Coloring Jordan Regions and Curves.

[BibT_eX]

[DOI]

Tobias Müller

SIAM J. Discret. Math., 2017

Flows and Bisections in Cubic Graphs.

[BibT_eX]

[DOI]

Giuseppe Mazzuoccolo

Michael Tarsi

J. Graph Theory, 2017

Graphs with No Induced Five-Vertex Path or Antipath.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Additive bases and flows in graphs.

[BibT_eX]

[DOI]

Rémi de Joannis de Verclos

Tien-Nam Le

Stéphan Thomassé

Electron. Notes Discret. Math., 2017

Long induced paths in graphs.

[BibT_eX]

[DOI]

Laetitia Lemoine

Eur. J. Comb., 2017

Box Representations of Embedded Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

Small Feedback Vertex Sets in Planar Digraphs.

[BibT_eX]

[DOI]

Laetitia Lemoine

Electron. J. Comb., 2017

Graph colorings, flows and perfect matchings. (Coloration de graphes, flots, et couplages parfaits).

[BibT_eX]

[DOI]

, 2017

2016

Islands in Graphs on Surfaces.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

Boxicity and topological invariants.

[BibT_eX]

[DOI]

Wouter Cames van Batenburg

Eur. J. Comb., 2016

Coloring pseudo-disks and Jordan curves.

[BibT_eX]

[DOI]

Tobias Müller

CoRR, 2016

Coloring Non-Crossing Strings.

[BibT_eX]

[DOI]

Daniel Gonçalves

Arnaud Labourel

Electron. J. Comb., 2016

Restricted Frame Graphs and a Conjecture of Scott.

[BibT_eX]

[DOI]

Jérémie Chalopin

Zhentao Li

Patrice Ossona de Mendez

Electron. J. Comb., 2016

2015

On the maximum fraction of edges covered by t perfect matchings in a cubic bridgeless graph.

[BibT_eX]

[DOI]

Giuseppe Mazzuoccolo

Discret. Math., 2015

Equitable partition of graphs into induced forests.

[BibT_eX]

[DOI]

Laetitia Lemoine

Discret. Math., 2015

2014

On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings.

[BibT_eX]

[DOI]

Giuseppe Mazzuoccolo

J. Graph Theory, 2014

List-Coloring Claw-Free Graphs with Small Clique Number.

[BibT_eX]

[DOI]

András Gyárfás

Graphs Comb., 2014

Distance-two coloring of sparse graphs.

[BibT_eX]

[DOI]

Zdenek Dvorák

Eur. J. Comb., 2014

Colouring Planar Graphs With Three Colours and No Large Monochromatic Components.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2014

2013

A Complexity Dichotomy for the Coloring of Sparse Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

Fire Containment in Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

Boxicity of Graphs on Surfaces.

[BibT_eX]

[DOI]

Graphs Comb., 2013

Acyclic edge-coloring using entropy compression.

[BibT_eX]

[DOI]

Aline Parreau

Eur. J. Comb., 2013

The chromatic number of {P5, K4}-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2013

Coloring planar graphs with three colors and no large monochromatic components

[BibT_eX]

[DOI]

CoRR, 2013

A unified approach to distance-two colouring of graphs on surfaces.

[BibT_eX]

[DOI]

Omid Amini

Jan van den Heuvel

Comb., 2013

2012

A superlinear bound on the number of perfect matchings in cubic bridgeless graphs.

[BibT_eX]

[DOI]

Frantisek Kardos

Daniel Král'

Eur. J. Comb., 2012

Locally Identifying Coloring of Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

2010

An improved linear bound on the number of perfect matchings in cubic graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

Acyclic improper colourings of graphs with bounded maximum degree.

[BibT_eX]

[DOI]

Louigi Addario-Berry

Ross J. Kang

Colin J. H. McDiarmid

Alexandre Pinlou

Discret. Math., 2010

Covering line graphs with equivalence relations.

[BibT_eX]

[DOI]

John Gimbel

Andrew D. King

Discret. Appl. Math., 2010

Dynamic list coloring of bipartite graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

2009

Adapted list coloring of planar graphs.

[BibT_eX]

[DOI]

Mickaël Montassier

Xuding Zhu

J. Graph Theory, 2009

Cubic bridgeless graphs have more than a linear number of perfect matchings.

[BibT_eX]

[DOI]

Frantisek Kardos

Daniel Král

Electron. Notes Discret. Math., 2009

Coloring a set of touching strings.

[BibT_eX]

[DOI]

Daniel Gonçalves

Arnaud Labourel

Electron. Notes Discret. Math., 2009

Boxicity of graphs with bounded degree.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

Game colouring of the square of graphs.

[BibT_eX]

[DOI]

Xuding Zhu

Discret. Math., 2009

A unified approach to distance-two colouring of planar graphs.

[BibT_eX]

[DOI]

Omid Amini

Jan van den Heuvel

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

On induced-universal graphs for the class of bounded-degree graphs.

[BibT_eX]

[DOI]

Arnaud Labourel

Inf. Process. Lett., 2008

Linear choosability of graphs.

[BibT_eX]

[DOI]

Mickaël Montassier

André Raspaud

Discret. Math., 2008

2007

Oriented colorings of 2-outerplanar graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Acyclic improper choosability of graphs.

[BibT_eX]

[DOI]

Alexandre Pinlou

Electron. Notes Discret. Math., 2007

On circle graphs with girth at least five.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Frugal Colouring of Graphs

[BibT_eX]

[DOI]

Omid Amini