Pierre Charbit

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 29

Top Topics

Tree Like Structures

Independent Set

Top Venues

J. Graph Theory

Electron. J. Comb.

Publications

Pierre Charbit, Stéphan Thomassé
Dichromatic Number and Cycle Inversions. CoRR (2024)
Pierre Aboulker, Guillaume Aubian, Pierre Charbit
Heroes in oriented complete multipartite graphs. J. Graph Theory 105 (4) (2024)
Pierre Aboulker, Guillaume Aubian, Pierre Charbit
Digraph Colouring and Arc-Connectivity. CoRR (2023)
Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
A new graph parameter to measure linearity. J. Graph Theory 103 (3) (2023)
Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Raul Lopes
Clique number of tournaments. CoRR (2023)
Paul Bastide, Marthe Bonamy, Anthony Bonato, Pierre Charbit, Shahin Kamali, Théo Pierron, Mikaël Rabie
Improved Pyrotechnics: Closer to the Burning Number Conjecture. Electron. J. Comb. 30 (4) (2023)
Pierre Aboulker, Guillaume Aubian, Pierre Charbit
Heroes in oriented complete multipartite graphs. CoRR (2022)
Pierre Aboulker, Guillaume Aubian, Pierre Charbit, Stéphan Thomassé
(P6, triangle)-free digraphs have bounded dichromatic number. CoRR (2022)
Pierre Aboulker, Guillaume Aubian, Pierre Charbit
Decomposing and colouring some locally semicomplete digraphs. Eur. J. Comb. 106 (2022)
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. CoRR (2021)
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM 68 (2) (2021)
Pierre Aboulker, Pierre Charbit, Reza Naserasr
Extension of Gyárfás-Sumner Conjecture to Digraphs. Electron. J. Comb. 28 (2) (2021)
Pierre Charbit, Gena Hahn, Marcin Kaminski, Manuel Lafond, Nicolas Lichiardopol, Reza Naserasr, Ben Seamone, Rezvan Sherkati
Edge clique covers in graphs with independence number two. J. Graph Theory 97 (2) (2021)
Paul Bastide, Marthe Bonamy, Pierre Charbit, Théo Pierron, Mikaël Rabie
Improved pyrotechnics : Closer to the burning graph conjecture. CoRR (2021)
Pierre Aboulker, Guillaume Aubian, Pierre Charbit
Decomposing and colouring some locally semicomplete digraphs. CoRR (2021)
Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
Parameterized Complexity of Independent Set in H-Free Graphs. Algorithmica 82 (8) (2020)
Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwenaël Joret, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor, Jean-Sébastien Sereni
Revisiting a Theorem by Folkman on Graph Colouring. Electron. J. Comb. 27 (1) (2020)
Pierre Aboulker, Pierre Charbit, Reza Naserasr
Extension of Gyarfas-Sumner conjecture to digraphs. CoRR (2020)
John Asplund, Pierre Charbit, Carl Feghali
Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations. Discret. Math. 342 (8) (2019)
Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
Parameterized Complexity of Independent Set in H-Free Graphs. CoRR (2018)
Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, Rémi Watrigant
Parameterized Complexity of Independent Set in H-Free Graphs. IPEC (2018)
Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé
EPTAS for Max Clique on Disks and Unit Balls. FOCS (2018)
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé
EPTAS for Max Clique on Disks and Unit Balls. CoRR (2018)
Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora
χ-bounded families of oriented graphs. J. Graph Theory 89 (3) (2018)
Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
A New Graph Parameter to Measure Linearity. COCOA (2) (2017)
Pierre Charbit, Lucas Hosseini, Patrice Ossona de Mendez
Limits of structures and the example of tree semi-lattices. Discret. Math. 340 (10) (2017)
Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
Towards A Unified View of Linear Structure on Graph Classes. CoRR (2017)
Pierre Charbit, Irena Penev, Stéphan Thomassé, Nicolas Trotignon
Perfect graphs of arbitrarily large clique-chromatic number. J. Comb. Theory, Ser. B 116 (2016)
Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora
$χ$-bounded families of oriented graphs. CoRR (2016)
Pierre Aboulker, Pierre Charbit, Nicolas Trotignon, Kristina Vuskovic
Vertex elimination orderings for hereditary graph classes. Discret. Math. 338 (5) (2015)
Ron Aharoni, Pierre Charbit, David M. Howard
On a Generalization of the Ryser-Brualdi-Stein Conjecture. J. Graph Theory 78 (2) (2015)
Henning Bruhn, Pierre Charbit, Oliver Schaudt, Jan Arne Telle
The graph formulation of the union-closed sets conjecture. Eur. J. Comb. 43 (2015)
Marthe Bonamy, Pierre Charbit, Stéphan Thomassé
Graphs with large chromatic number induce $3k$-cycles. CoRR (2014)
Pierre Charbit, Michel Habib, Antoine Mamcarz
Influence of the tie-break rule on the end-vertex problem. Discret. Math. Theor. Comput. Sci. 16 (2) (2014)
Ron Aharoni, Pierre Charbit, David M. Howard
On a Generalization of the Ryser-Brualdi-Stein Conjecture CoRR (2013)
Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic
Detecting 2-joins faster. J. Discrete Algorithms 17 (2012)
Pierre Aboulker, Pierre Charbit, Maria Chudnovsky, Nicolas Trotignon, Kristina Vuskovic
LexBFS, structure and algorithms CoRR (2012)
Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot
Linear Time Split Decomposition Revisited. SIAM J. Discret. Math. 26 (2) (2012)
Pierre Charbit, Michel Habib, Nicolas Trotignon, Kristina Vuskovic
Detecting 2-joins faster CoRR (2011)
Pierre Charbit, Jean-Sébastien Sereni
The fractional chromatic number of Zykov products of graphs. Appl. Math. Lett. 24 (4) (2011)
Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot
A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs CoRR (2009)
Pierre Charbit, András Sebö
Cyclic orders: Equivalence and duality. Comb. 28 (2) (2008)
Pierre Charbit, Emmanuel Jeandel, Pascal Koiran, Sylvain Perifel, Stéphan Thomassé
Finding a vector orthogonal to roughly half a collection of vectors. J. Complex. 24 (1) (2008)
Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao
A note on computing set overlap classes. Inf. Process. Lett. 108 (4) (2008)
Pierre Charbit, Stéphan Thomassé, Anders Yeo
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments. Comb. Probab. Comput. 16 (1) (2007)
Pierre Charbit, Alex D. Scott
Infinite Locally Random Graphs. Internet Math. 3 (3) (2007)
Pierre Charbit, Stéphan Thomassé
Graphs with Large Girth Not Embeddable in the Sphere. Comb. Probab. Comput. 16 (6) (2007)
Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao
A Note On Computing Set Overlap Classes CoRR (2007)