Computer Science Institute

Faculty of Mathematics and Physics, Charles University

Carl Feghali

Welcome to my homepage

I am a postdoctoral researcher at the Computer Science Institute of the Faculty of Mathematics and Physics of Charles University.

I obtained my Ph.D from Durham University in 2016 under the supervision of Matthew Johnson and Daniel Paulusma. Before coming to Charles, I was a postdoc at the University of Bergen and before that at Universite Paris Diderot.

My research interests include colorings and decompositions of graphs, combinatorial reconfiguration, combinatorial designs, extremal set theory and theoretical computer science.

Contact info : feghali.carl@gmail.com, Currriculum Vitae : CV .

Teaching

Co-authors Faisal N. Abu-Khzam John Asplund Marthe Bonamy Peter Borg Nicolas Bousquet Pierre Charbit Christophe Crespelle Konrad Dabrowski Zdenek Dvorak Eduard Eiben Jiri Fiala Petr Golovach Pinar Heggernes Glenn Hurlbert Matthew Johnson Vikram Kamat Haiko Muller Giacomo Paesani Daniel Paulusma Pawel Rzazewski Daniel Thomas

Papers
  1. (with P. Borg) The maximum sum of sizes of cross-intersecting families of subsets of a set, submitted.

  2. (with P. Borg) A simple proof of Talbot's theorem for intersecting separated sets, submitted.

  3. (with Z. Dvorak) A Thomassen-type method for planar graph recoloring , submitted.

  4. (with Z. Dvorak) An update on reconfiguring 10-colorings of planar graphs, submitted.

  5. (with C. Crespelle, P. A. Golovach) Cyclability in graph classes, submitted.

  6. (with M. Bonamy, K. Dabrowski, M. Johnson and D. Paulusma) Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration , submitted

  7. Reconfiguring colorings of graphs with bounded maximum average degree, submitted.

  8. (with P. Borg) The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem,
    Discussiones Mathematicae Graph Theory, to appear.

  9. (with G. Hurlbert, V. Kamat) An Erdos-Ko-Rado Theorem for unions of length 2 paths,
    Discrete Mathematics, to appear.

  10. Reconfiguring 10-colourings of planar graphs,
    Graphs and Combinatorics, to appear.

  11. (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, to appear.

  12. (with E. Eiben), Towards Cereceda's conjecture for planar graphs.,
    Journal of Graph Theory, 94 (2020), 267-277.

  13. Intersecting families, signed sets, and injection
    The Australasian Journal of Combinatorics, 76 (2020) 226-231.

  14. (with J. Fiala) Reconfiguration graph for vertex colourings of weakly chordal graphs,
    Discrete Mathematics, 343 (2020) 111733, 6 pp.

  15. (with F. N. Abu-Khzam and P. Heggernes), Partitioning a graph into degenerate subgraphs,
    European Journal of Combinatorics, 23 (2020) 103015.

  16. (with J. Asplund and P. Charbit), Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations,
    Discrete Mathematics 342 (2019) 2195-2203.

  17. (with M. Bonamy, K. Dabrowski, M. Johnson and D. Paulusma) Independent feedback vertex set for P5-free graphs,
    Algorithmica 81 (2019) 1342-1369.

  18. Paths between colourings of graphs with bounded tree-width
    Information Processing Letters 144 (2019) 37-38.

  19. (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.

  20. Paths between colourings of sparse graphs,
    European Journal of Combinatorics 75 (2019), 169-171. doi

  21. (with M. Johnson) Enclosings of decompositions of complete multigraphs in 2-factorizations,
    Journal of Combinatorial Designs 26 (2018), 205-218. doi

  22. (with M. Johnson and D. Thomas) Erdos-Ko-Rado theorems for a family of trees,
    Discrete Applied Mathematics 236 (2018), 464-471. doi

  23. (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

  24. (with M. Johnson and D. Paulusma) A reconfigurations analogue of Brooks' theorem and its consequences,
    Journal of Graph Theory 83 (2016), 340-358. doi

  25. (with M. Johnson and D. Paulusma) Kempe equivalence of colourings of cubic graphs,
    European Journal of Combinatorics 59 (2017), 1-10. doi

  26. (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
  1. (with C. Crespelle, P. A. Golovach) Cyclability in graph classes,
    Proceedings of ISAAC 2019.

  2. (with J. Fiala),
    Reconfiguration graph for vertex colourings of weakly chordal graphs,
    Proceedings of EuroComb 2019.

  3. (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.

  4. (with M. Bonamy, K. Dabrowski, M. Johnson and D. Paulusma),
    Independent feedback vertex set for P5-free graphs,
    Proceedings of ISAAC 2017, LIPIcs.

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

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

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

Talks