Go back to the home page of Pierre Charbit.



List of Publications

  1. (P6, triangle)-free digraphs have bounded dichromatic number. Submitted (2023)
    with P. Aboulker . G. Aubian. and S. Thomassé.
  2. Heroes in oriented complete multipartite graphs. Submitted (2022)
    with P. Aboulker . and G. Aubian.
  3. Improved pyrotechnics : Closer to the burning graph conjecture Submitted (2022)
    with P. Bastide, M. Bonamy, T. Pierron, M. Rabie.
  4. Decomposing and colouring some locally semicomplete digraphs. Eur. J. Comb. 106: 103591 (2022)
    with P. Aboulker . and G. Aubian.
  5. Extension of Gyarfas-Sumner conjecture to digraphs Electron. J. Comb. 28(2): P2.27 (2021)
    with P. Aboulker . and R. Naserasr
  6. EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs Journal of the ACM (2021)
    with P. Giannopoulos, P. Rzadewski, E.J Kim, F. Sikora, M. Bonamy, E. Bonnet, N. Bousquet and S. Thomassé.
  7. Edge clique covers in graphs with independence number two. Journal of Graph Theory (2021)
    B. Seamone, R. Naserasr , N. Lichiardopol , M. Lafond and M. Kamiński, G. Hahn and Rezvan Sherkati
  8. Parameterized Complexity of Independent Set in H-Free Graphs” Algorithmica 82 - 8 (2020) p. 2360-2394
    with E.Bonnet , N.Bousquet , S. Thomassé and R.Watrigant.
  9. Revisiting a Theorem by Folkman on Graph Colouring. Electron. J. Comb. 27(1): P1.56 (2020)
    avec M. Bonamy, O. Defrain , Gwenael Joret and Aurélie Lagoutte Vincent Limouzy Lucas Pastor Jean-Sebastien Sereni
  10. Parameterized Complexity of Independent Set in H-Free Graphs. IPEC 2018 and then Journal Version : Algorithmica 82(8): 2360-2394 (2020)
    with E.Bonnet , N.Bousquet , S. Thomassé and R.Watrigant.
  11. Enclosings of Decompositions of Complete Multigraphs in 2-Edge-Connected r-Factorizations Discrete Mathematics, Volume 342, Issue 8 : 2195-2203 (2019)
    with J.Asplund , and C.Feghali .
  12. EPTAS for Max Clique on Disks etUnit Balls. FOCS 2018
    with M. Bonamy, E. Bonnet , N. Bousquet et S. Thomassé
  13. Chi-bounded families of oriented graphs. Journal of Graph Theory, Volume 89, Issue3, pp 304-326 (2018)
    with P. Aboulker , J. Bang-Jensen , N.Bousquet , F.Havet, F. Maffray and J.Zamora .
  14. Limits of Structures and the Example of Tree Semi-Lattices. Discrete Mathematics, Volume 340, Issue 10, October 2017, Pages 2589-2603 (2017)
    with L. Hosseini and P. Ossona de Mendez..
  15. Perfect graphs of arbitrarily large clique-chromatic number, Journal of Combinatorial Theory, Series B, Volume 116, January 2016, Pages 456-464 (2016).
    with I. Penev, S. Thomassé and N. Trotignon
  16. Graphs avec large chromatic number induce 3k-cycles
    with S. Thomassé and M. Bonamy.
  17. The Graph formulation of the union-closed set conjecture, European Journal of Combinatorics, Vol43 210-219 (2015)
    with Henning Bruhn, Oliver Schaudt and Jan Arne Telle
  18. Influence of the tie-break rule on the end-vertex problem, Discrete Mathematics & Theoretical Computer Science 16(2): 57-72 (2014)
    with M. Habib and A. Mamcarz
  19. Vertex elimination orderings for hereditary graph classes Discrete Mathematics Volume 338, Issue 5, Pages 669-834 , (2015)
    with P. Aboulker, N. Trotignon and K. Vušković
  20. On a Generalization of the Ryser-Brualdi-Stein Conjecture Journal of Graph Theory 78 , no. 2, 143–156 (2014)
    with Ron Aharoni and David Howard
  21. Detecting 2-joins faster arxiv Journal of Discrete Algorithms 17, pp. 60-66 (2012)
    with M. Habib , N. Trotignon and K. Vušković .
  22. Linear Time Split Decomposition Revisited SIAM J. Discrete Math. 26, pp. 499-514 (2012)
    with F. de Montgolfier and M. Raffinot .
  23. The Fractional Chromatic Number of Zykov Products of Graphs , Applied Mathematics Letters, 24(4):432--437 (2011)
    with J.S. Sereni .
  24. A Note On Computing Set Overlap Classes, Information Processing Landters 108(4): 186-191 (2008).
    with M. Habib , V. Limouzy , F. de Montgolfier , M. Raffinot and M. Rao
  25. Graph with large girth not embeddable in the sphere Combinatorics, Probability and Computing, 16 829-832 (2007).
    with S. Thomassé.
  26. The Mimimum Feedback Arc Set Problem is NP-Hard for Tournaments, Combinatorics, Probability and Computing, 16 1--4, (2007)
    with S. Thomassé and A.Yeo .
  27. Finding Vector Orthogonal to Roughly half a Collections of Vectors Journal of Complexity, volume 24(1), pages 39-53, (2008)
    with E. Jeandel , P. Koiran , S. Perifel and S. Thomassé.
  28. Cyclic Orders : Equivalence and Duality Combinatorica 28 (2), 131-143. , (2008)
    with A. Sebő.
  29. Infinite Locally Random Graphs Internet Mathematics , Volume 3, Number 3 (2006), 321-332.
    with A. Scott.

Unpublished

Mémoires - These