Carl Feghali

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.

1. (with D. W. Cranston) Kempe classes and almost bipartite graphs, submitted.
2. (with D. Chakraborty, R. Mahmoud) Kempe equivalent list colorings revisited submitted
3. (with F. Lucke, D. Paulusma and B. Ries) Matching Cuts in Graphs of High Girth and H-Free Graphs submitted.
4. (with P. Borg and R. Pellerin) Solution to a problem of Katona on counting cliques for weighted graphs, submitted.
5. (with T. Corsini, Q. Deschamps, D. Goncalves, H. Langlois, A. Talon) Partitioning into degenerate graphs in linear time ,
   European Journal of Combinatorics, under revision.
6. (with P. Bergé, A. Busson and R. Watrigant) 1-extendability of independent sets ,
   Algorithmica, under revision.
7. (with R. Samal) Decomposing a triangle-free planar graph into a forest and a subcubic forest,
   European Journal of Combinatorics, under revision.
8. (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.
9. Kempe equivalence of 4-critical planar graphs
   Journal of Graph Theory, to appear.
10. (with Q. Deschamps, F. Kardos, C. Legrand-Duschene and T. Pierron) Strengthening a theorem of Meyniel,
    SIAM Journal on Discrete Mathematics, 37 (2023), 332-350.
11. (with P. Borg) The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem,
    Discussiones Mathematicae Graph Theory, 43 (2023) 277-286.
12. (with O. Merkel) Mixing colourings in 2K2-free graphs,
    Discrete Mathematics, 345 (2022) 113108.
13. (with P. Borg) The maximum sum of sizes of cross-intersecting families of subsets of a set,
    Discrete Mathematics, 345 (2022), 112981.
14. A note on Matching-Cut in Pt-free graphs,
    Information Processing Letters, (2022) 106294.
15. (with P. Borg) A short proof of Talbot's theorem for intersecting separated sets,
    European Journal of Combinatorics, 101 (2022) 103471.
16. (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.
17. (with Z. Dvorak) A Thomassen-type method for planar graph recoloring ,
    European Journal of Combinatorics, 95 (2021) 103319.
18. Reconfiguring colorings of graphs with bounded maximum average degree,
    Journal of Combinatorial Theory Series B 147 (2021) 133-138
19. (with Z. Dvorak) An update on reconfiguring 10-colorings of planar graphs,
    The Electronic Journal of Combinatorics 27 (2020) P4.51.
20. (with G. Hurlbert, V. Kamat) An Erdos-Ko-Rado Theorem for unions of length 2 paths,
    Discrete Mathematics, 12 (2020) 112121.
21. Reconfiguring 10-colourings of planar graphs,
    Graphs and Combinatorics 36 (2020) 1815-1818.
22. (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.
23. (with E. Eiben), Towards Cereceda's conjecture for planar graphs.,
    Journal of Graph Theory, 94 (2020), 267-277.
24. Intersecting families, signed sets, and injection
    The Australasian Journal of Combinatorics, 76 (2020) 226-231.
25. (with J. Fiala) Reconfiguration graph for vertex colourings of weakly chordal graphs,
    Discrete Mathematics, 343 (2020) 111733, 6 pp.
26. (with F. N. Abu-Khzam and P. Heggernes), Partitioning a graph into degenerate subgraphs,
    European Journal of Combinatorics, 23 (2020) 103015.
27. (with J. Asplund and P. Charbit), Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations,
    Discrete Mathematics 342 (2019) 2195-2203.
28. (with M. Bonamy, K. Dabrowski, M. Johnson and D. Paulusma) Independent feedback vertex set for P5-free graphs,
    Algorithmica 81 (2019) 1342-1369.
29. Paths between colourings of graphs with bounded tree-width
    Information Processing Letters 144 (2019) 37-38.
30. (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.
31. Paths between colourings of sparse graphs,
    European Journal of Combinatorics 75 (2019), 169-171. doi
32. (with M. Johnson) Enclosings of decompositions of complete multigraphs in 2-factorizations,
    Journal of Combinatorial Designs 26 (2018), 205-218. doi
33. (with M. Johnson and D. Thomas) Erdos-Ko-Rado theorems for a family of trees,
    Discrete Applied Mathematics 236 (2018), 464-471. doi
34. (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
35. (with M. Johnson and D. Paulusma) Kempe equivalence of colourings of cubic graphs,
    European Journal of Combinatorics 59 (2017), 1-10. doi
36. (with M. Johnson and D. Paulusma) A reconfigurations analogue of Brooks' theorem and its consequences,
    Journal of Graph Theory 83 (2016), 340-358. doi
37. (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

• (with T. Corsini, Q. Deschamps, D. Goncalves, H. Langlois, A. Talon) Partiioning into degenerate graphs in linear time,
  ICGT 2022.
• (with A. Busson, P. Berge, R. Watrigant) 1-extendability of Independent sets,
  IWOCA 2022.
• (with C. Crespelle, P. A. Golovach) Cyclability in graph classes,
  Proceedings of ISAAC 2019.
• (with J. Fiala),
  Reconfiguration graph for vertex colourings of weakly chordal graphs,
  Proceedings of EuroComb 2019.
• (with M. Johnson, G. Paesani, D. Paulusma),
  On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest,
  Proceedings of FCT 2019.
• (with M. Bonamy, K. Dabrowski, M. Johnson and D. Paulusma),
  Independent feedback vertex set for P5-free graphs,
  Proceedings of ISAAC 2017, LIPIcs.

• (with M. Bonamy, K. Dabrowski, M. Johnson and D. Paulusma),
  Recognizing graphs close to bipartite graphs,
  Proceedings of MFCS 2017, LIPIcs.

• (with M. Johnson and D. Paulusma),
  Kempe equivalence of colourings of cubic graphs,
  Proceedings of EuroComb 2015, ENDM.

• (with M. Johnson and D. Paulusma),
  A reconfigurations analogue of Brooks' theorem,
  Proceedings of MFCS 2014, LNCS.

• Around the matching-cut problem, Journées Graphes et Algorithmes (JGA) 2022
• Graph theory meets extremal set theory, Illinois State University, 2022.
• Kempe equivalence of 4-critical planar graphs, Journées Graphes et Algorithmes (JGA) 2021.
• Colorings and decompositions of planar graphs, CANADAM 2021.
• Colorings and decompositions of planar graphs, LaBRi, Université de Bordeaux, June 2021.
• Colorings and decompositions of planar graphs, Virginia Commonwealth University, March 2021.
• Planar graph recoloring: two proofs, 55th Czech-Slovak Conference on Graph Theory 2020, Brno, Czech Republic, August 2020
• Revisiting a theorem of Talbot, Midsummer Combinatorial workshop, Prague, Czech Republic, August 2020.
• Graph theory meets extremal set theory, Charles University of Prague, Czech Republic, November 2019.
• Kempe equivalence of regular graphs, University of Malta, June 2019.
• Reconfiguring colourings of graphs with bounded maximum average degree, Combinatorial Reconfiguration Workshop, France 2019.
• Erdos--Ko--Rado theorems for a family of trees, Alfred Renyi Institute of Mathematics, Hungary, April 2018.
• Partitioning a graph into degenerate subgraphs, Algorithms group, The University of Bergen, Norway, January 2018.
• Problems and Results in Kempe equivalence of colourings, Society of Industrial and Applied Mathematics, USA, June 2016.
• A reconfigurations analogue of Brooks' theorem, British Conference on Theoretical Computer Science, UK, March 2015.
• A reconfigurations analogue of Brooks' theorem, Mathematical Foundations of Computer Science, Hungary, July 2014.

• TP LIFASR3 (2021) - Université Claude Bernard Lyon
• TD Combinatorics and graph theory II (2020) - Charles University in Prague
• TD Theory of Computation (2014-2015) - Durham University
• TD Mathematics for Computer Science (2014-2015) - Durham University

co-supervising Ali Momeni with Edouard Bonnet (M2, ENS Lyon, 2023)

WG 2023, PC member