Pierre Charbit

Guillaume Aubian

J. Graph Theory, April, 2024

Dichromatic Number and Cycle Inversions.

[BibT_eX]

[DOI]

CoRR, 2024

2023

A new graph parameter to measure linearity.

[BibT_eX]

[DOI]

J. Graph Theory, July, 2023

Clique number of tournaments.

[BibT_eX]

[DOI]

CoRR, 2023

Digraph Colouring and Arc-Connectivity.

[BibT_eX]

[DOI]

Guillaume Aubian

CoRR, 2023

Improved Pyrotechnics: Closer to the Burning Number Conjecture.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

2022

Decomposing and colouring some locally semicomplete digraphs.

[BibT_eX]

[DOI]

Guillaume Aubian

Eur. J. Comb., 2022

(P6, triangle)-free digraphs have bounded dichromatic number.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Edge clique covers in graphs with independence number two.

[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

Improved pyrotechnics : Closer to the burning graph conjecture.

[BibT_eX]

[DOI]

CoRR, 2021

Extension of Gyárfás-Sumner Conjecture to Digraphs.

[BibT_eX]

[DOI]

Reza Naserasr

Electron. J. Comb., 2021

2020

Revisiting a Theorem by Folkman on Graph Colouring.

[BibT_eX]

[DOI]

Jean-Sébastien Sereni

Electron. J. Comb., 2020

Parameterized Complexity of Independent Set in H-Free Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2020

2019

Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations.

[BibT_eX]

[DOI]

John Asplund

Carl Feghali

Discret. Math., 2019

About Some Hereditary Classes of Graphs : Algorithms - Structure - Coloration.

[BibT_eX]

[DOI]

, 2019

2018

χ-bounded families of oriented graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 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

Limits of structures and the example of tree semi-lattices.

[BibT_eX]

[DOI]

Lucas Hosseini

Patrice Ossona de Mendez

Discret. Math., 2017

Towards A Unified View of Linear Structure on Graph Classes.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Perfect graphs of arbitrarily large clique-chromatic number.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2016

2015

On a Generalization of the Ryser-Brualdi-Stein Conjecture.

[BibT_eX]

[DOI]

Ron Aharoni

David M. Howard

J. Graph Theory, 2015

The graph formulation of the union-closed sets conjecture.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

Vertex elimination orderings for hereditary graph classes.

[BibT_eX]

[DOI]

Discret. Math., 2015

2014

Influence of the tie-break rule on the end-vertex problem.

[BibT_eX]

[DOI]

Michel Habib

Antoine Mamcarz

Discret. Math. Theor. Comput. Sci., 2014

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

[BibT_eX]

[DOI]

Marthe Bonamy

CoRR, 2014

2012

Linear Time Split Decomposition Revisited.

[BibT_eX]

[DOI]

Fabien de Montgolfier

Mathieu Raffinot

SIAM J. Discret. Math., 2012

Detecting 2-joins faster.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

LexBFS, structure and algorithms

[BibT_eX]

[DOI]

CoRR, 2012

2011

The fractional chromatic number of Zykov products of graphs.

[BibT_eX]

[DOI]

Jean-Sébastien Sereni

Appl. Math. Lett., 2011

2009

A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs

[BibT_eX]

[DOI]

Fabien de Montgolfier

Mathieu Raffinot

CoRR, 2009

2008

Finding a vector orthogonal to roughly half a collection of vectors.

[BibT_eX]

[DOI]

J. Complex., 2008

A note on computing set overlap classes.

[BibT_eX]

[DOI]

Michel Habib

Vincent Limouzy

Fabien de Montgolfier

Mathieu Raffinot

Michaël Rao

Inf. Process. Lett., 2008

Cyclic orders: Equivalence and duality.

[BibT_eX]

[DOI]

András Sebö

Comb., 2008

2007

Infinite Locally Random Graphs.

[BibT_eX]

[DOI]

Alex D. Scott

Internet Math., 2007

The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments.

[BibT_eX]

[DOI]

Anders Yeo

Comb. Probab. Comput., 2007

Graphs with Large Girth Not Embeddable in the Sphere.

[BibT_eX]

[DOI]