Carl Feghali

me
Hello and welcome to my homepage! I am a postdoctoral researcher at LIP in the MC2 team. Previously, I was a CNRS postdoctoral researcher in the same team.

I obtained my Ph.D from Durham University in 2017 under the supervision of Matthew Johnson and Daniel Paulusma. Before coming to Lyon, I was a postdoc at Charles University in Prague (2019-2021) working with Zdeněk Dvořák and Robert Šámal, the University of Bergen (2017-2019) and Université Paris Diderot (2016-2017) working with Pierre Charbit.

This year I am organizing the (in person) MC2 seminar.

Research interests: Graph Theory, Combinatorics and Algorithms.


Contact info : carl.feghali@ens-lyon.fr

Teaching

Co-authors Faisal N. Abu-Khzam John Asplund Valentin Bartier Marthe Bonamy Peter Borg Nicolas Bousquet Pierre Charbit Timothee Corsini Christophe Crespelle Konrad Dabrowski Quentin Deschamps Zdenek Dvorak Eduard Eiben Jiri Fiala Petr Golovach Daniel Goncalves Pinar Heggernes Marc Heinrich Glenn Hurlbert Matthew Johnson Vikram Kamat Helene Langlois Owen Merkel Benjamin Moore Haiko Muller Giacomo Paesani Daniel Paulusma Remi Pellerin Théo Pierron Pawel Rzazewski Robert Samal Alexandre Talon Daniel Thomas Remi Watrigant

Papers
  1. (with D. Chakraborty) manuscript in preparation
  2. (with F. Lucke, D. Paulusma and B. Ries) manuscript in preparation
  3. (with P. Borg and R. Pellerin) Solution to a problem of Katona on counting cliques for weighted graphs, manuscript.
  4. (with T. Corsini, Q. Deschamps, D. Goncalves, H. Langlois, A. Talon) Partitioning into degenerate graphs in linear time , submitted.
  5. (with P. Bergé, A. Busson and R. Watrigant) 1-extendability of independent sets , submitted.
  6. (with R. Samal) Decomposing a triangle-free planar graph into a forest and a subcubic forest,
    European Journal of Combinatorics, under revision.
  7. (with Q. Deschamps, F. Kardos, C. Legrand-Duschene and T. Pierron) Strengthening a theorem of Meyniel,
    SIAM Journal on Discrete Mathematics, accepted.
  8. Kempe equivalence of 4-critical planar graphs
    Journal of Graph Theory, accepted.
  9. (with V. Bartier, N. Bousquet, M. Heinrich, B. Moore and T. Pierron) Recolouring planar graphs of girth at least five,
    SIAM Journal on Discrete Mathematics, accepted.
  10. (with O. Merkel) Mixing colourings in 2K2-free graphs,
    Discrete Mathematics, 345 (2022) 113108.
  11. (with P. Borg) The maximum sum of sizes of cross-intersecting families of subsets of a set,
    Discrete Mathematics, 345 (2022), 112981.
  12. A note on Matching-Cut in Pt-free graphs,
    Information Processing Letters, (2022) 106294.
  13. (with P. Borg) A short proof of Talbot's theorem for intersecting separated sets,
    European Journal of Combinatorics, 101 (2022) 103471.
  14. (with M. Bonamy, K. Dabrowski, M. Johnson and D. Paulusma) Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration ,
    Journal of Graph Theory, 98 (2021), no. 1, 81-109.
  15. (with Z. Dvorak) A Thomassen-type method for planar graph recoloring ,
    European Journal of Combinatorics, 95 (2021) 103319.
  16. Reconfiguring colorings of graphs with bounded maximum average degree,
    Journal of Combinatorial Theory Series B 147 (2021) 133-138
  17. (with Z. Dvorak) An update on reconfiguring 10-colorings of planar graphs,
    The Electronic Journal of Combinatorics 27 (2020) P4.51.
  18. (with P. Borg) The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem,
    Discussiones Mathematicae Graph Theory, in press.
  19. (with G. Hurlbert, V. Kamat) An Erdos-Ko-Rado Theorem for unions of length 2 paths,
    Discrete Mathematics, 12 (2020) 112121.
  20. Reconfiguring 10-colourings of planar graphs,
    Graphs and Combinatorics 36 (2020) 1815-1818.
  21. (with K. Dabrowski, M. Johnson, G. Paesani, D. Paulusma, P. Rzazewski) On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest,
    Algorithmica 82 (2020) 2841-2866.
  22. (with E. Eiben), Towards Cereceda's conjecture for planar graphs.,
    Journal of Graph Theory, 94 (2020), 267-277.
  23. Intersecting families, signed sets, and injection
    The Australasian Journal of Combinatorics, 76 (2020) 226-231.
  24. (with J. Fiala) Reconfiguration graph for vertex colourings of weakly chordal graphs,
    Discrete Mathematics, 343 (2020) 111733, 6 pp.
  25. (with F. N. Abu-Khzam and P. Heggernes), Partitioning a graph into degenerate subgraphs,
    European Journal of Combinatorics, 23 (2020) 103015.
  26. (with J. Asplund and P. Charbit), Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations,
    Discrete Mathematics 342 (2019) 2195-2203.
  27. (with M. Bonamy, K. Dabrowski, M. Johnson and D. Paulusma) Independent feedback vertex set for P5-free graphs,
    Algorithmica 81 (2019) 1342-1369.
  28. Paths between colourings of graphs with bounded tree-width
    Information Processing Letters 144 (2019) 37-38.
  29. (with M. Bonamy, N. Bousquet and M. Johnson) On a conjecture of Mohar concerning Kempe equivalence of regular graphs,
    Journal of Combinatorial Theory Series B 135 (2019) 179-199.
  30. Paths between colourings of sparse graphs,
    European Journal of Combinatorics 75 (2019), 169-171. doi
  31. (with M. Johnson) Enclosings of decompositions of complete multigraphs in 2-factorizations,
    Journal of Combinatorial Designs 26 (2018), 205-218. doi
  32. (with M. Johnson and D. Thomas) Erdos-Ko-Rado theorems for a family of trees,
    Discrete Applied Mathematics 236 (2018), 464-471. doi
  33. (with M. Bonamy, K. Dabrowski, M. Johnson and D. Paulusma) Independent feedback vertex sets for graphs of bounded diameter,
    Information Processing Letters 131 (2018), 26-32.doi
  34. (with M. Johnson and D. Paulusma) Kempe equivalence of colourings of cubic graphs,
    European Journal of Combinatorics 59 (2017), 1-10. doi
  35. (with M. Johnson and D. Paulusma) A reconfigurations analogue of Brooks' theorem and its consequences,
    Journal of Graph Theory 83 (2016), 340-358. doi
  36. (with F. N. Abu-Khzam and H. Muller) Partitioning a graph into disjoint cliques and a triangle-free graph,
    Discrete Applied Mathematics 190-191 (2015), 1-12. doi

Conference proceedings

Talks

Conference activities