Carl Feghali

Most-cited papers

1. A Reconfigurations Analogue of Brooks' Theorem and Its Consequences

   Carl Feghali, Matthew P. Johnson, D. Paulusma

   2014Journal of Graph Theory45 citations Open access

   Semantic Scholar

   Save

2. Independent Feedback Vertex Set for $$P_5$$P5-Free Graphs

   Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew P. Johnson +1 more

   2017Algorithmica40 citations Open access

   Semantic Scholar

   Save

3. On a conjecture of Mohar concerning Kempe equivalence of regular graphs

   Marthe Bonamy, N. Bousquet, Carl Feghali, Matthew P. Johnson

   2015J. Comb. Theory B38 citations Open access

   Semantic Scholar

   Save

4. Kempe equivalence of colourings of cubic graphs

   Carl Feghali, Matthew P. Johnson, D. Paulusma

   2015European journal of combinatorics (Print)37 citations Open access

   Semantic Scholar

   Save

5. A Thomassen-type method for planar graph recoloring

   Z. Dvořák, Carl Feghali

   2020European journal of combinatorics (Print)21 citations Open access

   Semantic Scholar

   Save

6. On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest

   Konrad K. Dabrowski, Carl Feghali, Matthew P. Johnson, Giacomo Paesani +2 more

   2019Algorithmica19 citations Open access

   Semantic Scholar

   Save

7. Paths between colourings of sparse graphs

   Carl Feghali

   2018European journal of combinatorics (Print)19 citations Open access

   Semantic Scholar

   Save

8. Independent Feedback Vertex Sets for Graphs of Bounded Diameter

   Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew P. Johnson +1 more

   2017Information Processing Letters19 citations Open access

   Semantic Scholar

   Save

9. Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration

   Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew P. Johnson +1 more

   2017International Symposium on Mathematical Foundations of Computer Science18 citations Open access

   Semantic Scholar

   Save

10. The maximum sum of sizes of cross-intersecting families of subsets of a set

    Peter Borg, Carl Feghali

    2020Discrete Mathematics16 citations Open access

    Semantic Scholar

    Save

11. Recoloring Planar Graphs of Girth at Least Five

    Valentin Bartier, N. Bousquet, Carl Feghali, Marc Heinrich +2 more

    2023SIAM Journal on Discrete Mathematics15 citations

    Semantic Scholar

    Save

12. Matching Cuts in Graphs of High Girth and H-Free Graphs

    Carl Feghali, Felicia Lucke, Daniël Paulusma, B. Ries

    2022Algorithmica15 citations Open access

    Semantic Scholar

    Save

13. An Update on Reconfiguring $10$-Colorings of Planar Graphs

    Z. Dvořák, Carl Feghali

    2020Electronic Journal of Combinatorics15 citations Open access

    Semantic Scholar

    Save

14. Erdős-Ko-Rado theorems for a family of trees

    Carl Feghali, Matthew P. Johnson, Daniel Thomas

    2015Discrete Applied Mathematics14 citations Open access

    Semantic Scholar

    Save

15. A note on Matching-Cut in Pt-free Graphs

    Carl Feghali

    2021Information Processing Letters11 citations Open access

    Semantic Scholar

    Save

16. Reconfiguration Graph for Vertex Colourings of Weakly Chordal Graphs

    Carl Feghali, J. Fiala

    2019Discrete Mathematics11 citations Open access

    Semantic Scholar

    Save

17. Decomposing a triangle-free planar graph into a forest and a subcubic forest

    Carl Feghali, Robert Šámal

    2020European journal of combinatorics (Print)9 citations Open access

    Semantic Scholar

    Save

18. Reconfiguring colourings of graphs with bounded maximum average degree

    Carl Feghali

    2019arXiv.org9 citations

    Semantic Scholar

    Save

19. Kempe equivalence of 4‐critical planar graphs

    Carl Feghali

    2021Journal of Graph Theory7 citations Open access

    Semantic Scholar

    Save

20. Recolouring planar graphs of girth at least five

    Valentin Bartier, N. Bousquet, Carl Feghali, Marc Heinrich +2 more

    20216 citations

    Semantic Scholar

    Save

21. An Erdős-Ko-Rado theorem for unions of length 2 paths

    Carl Feghali, Glenn H. Hurlbert, Vikram Kamat

    2020Discrete Mathematics6 citations Open access

    Semantic Scholar

    Save

22. Reconfiguring 10-Colourings of Planar Graphs

    Carl Feghali

    2019Graphs and Combinatorics6 citations Open access

    Semantic Scholar

    Save

23. Towards Cereceda's conjecture for planar graphs

    E. Eiben, Carl Feghali

    2018arXiv.org6 citations

    Semantic Scholar

    Save

24. On the Hilton-Spencer intersection theorems for unions of cycles

    Peter Borg, Carl Feghali

    20195 citations

    Semantic Scholar

    Save

25. Paths between colourings of graphs with bounded tree-width

    Carl Feghali

    2019Information Processing Letters5 citations

    Semantic Scholar

    Save

26. Partitioning a graph into degenerate subgraphs

    Faisal N. Abu-Khzam, Carl Feghali, P. Heggernes

    2018European journal of combinatorics (Print)5 citations Open access

    Semantic Scholar

    Save

27. Kempe classes and almost bipartite graphs

    Daniel W. Cranston, Carl Feghali

    2023Discrete Applied Mathematics4 citations Open access

    Semantic Scholar

    Save

28. 1-Extendability of Independent Sets

    Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant

    2022Algorithmica4 citations Open access

    Semantic Scholar

    Save

29. Strengthening a theorem of Meyniel

    Quentin Deschamps, Carl Feghali, František Kardoš, Clément Legrand-Duchesne +1 more

    2022SIAM Journal on Discrete Mathematics4 citations Open access

    Semantic Scholar

    Save

30. Mixing colourings in 2K2-free graphs

    Carl Feghali, Owen D. Merkel

    2021Discrete Mathematics4 citations Open access

    Semantic Scholar

    Save

31. Forbidden subgraph characterization of (P3-free, K3-free)-colourable cographs

    Carl Feghali, Faisal N. Abu-Khzam, H. Müller

    2014arXiv.org4 citations

    Semantic Scholar

    Save

32. Beyond recognizing well-covered graphs

    Carl Feghali, Malory Marin, R´emi Watrigant

    2024International Workshop on Graph-Theoretic Concepts in Computer Science3 citations

    Semantic Scholar

    Save

33. Partitioning into degenerate graphs in linear time

    Timothée Corsini, Quentin Deschamps, Carl Feghali, D. Gonçalves +2 more

    2022European journal of combinatorics (Print)3 citations Open access

    Semantic Scholar

    Save

34. Enclosings of decompositions of complete multigraphs in 2‐factorizations

    Carl Feghali, Matthew P. Johnson

    20163 citations Open access

    Semantic Scholar

    Save

35. NP-hardness results for partitioning graphs into disjoint cliques and a triangle-free subgraph

    Carl Feghali, Faisal N. Abu-Khzam, H. Müller

    2014arXiv.org3 citations

    Semantic Scholar

    Save

36. The Hilton-Spencer Cycle Theorems Via Katona’s Shadow Intersection Theorem

    Peter Borg, Carl Feghali

    2022Discussiones Mathematicae Graph Theory2 citations Open access

    Semantic Scholar

    Save

37. Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations

    J. Asplund, Pierre Charbit, Carl Feghali

    2018Discrete Mathematics2 citations Open access

    Semantic Scholar

    Save

38. The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability

    Carl Feghali, Hoàng-Oanh Le, Van Bang Le

    2025Discrete Applied Mathematics1 citations Open access

    Semantic Scholar

    Save

39. Dirac's theorem on chordal graphs implies Brooks' theorem

    Carl Feghali

    2023Discrete Mathematics1 citations Open access

    Semantic Scholar

    Save

40. A short proof of Talbot's theorem for intersecting separated sets

    Peter Borg, Carl Feghali

    2022European journal of combinatorics (Print)1 citations Open access

    Semantic Scholar

    Save

41. Cyclability in Graph Classes

    C. Crespelle, Carl Feghali, P. Golovach

    2022International Symposium on Algorithms and Computation1 citations

    Semantic Scholar

    Save

42. New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching

    Carl Feghali, Felicia Lucke, Daniël Paulusma, B. Ries

    2022arXiv.org1 citations Open access

    Semantic Scholar

    Save

43. On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest

    Konrad K. Dabrowski, Carl Feghali, Matthew P. Johnson, Giacomo Paesani +2 more

    2020Algorithmica1 citations Open access

    Semantic Scholar

    Save

44. Intersecting families, signed sets, and injection

    Carl Feghali

    2019The Australasian Journal of Combinatorics1 citations

    Semantic Scholar

    Save

45. Multiply Erd\H{o}s-Ko-Rado Theorem

    Carl Feghali

    20171 citations

    Semantic Scholar

    Save

46. Erd\H{o}s-Ko-Rado Theorems for a Family of Trees

    Carl Feghali, Matthew P. Johnson, Daniel Thomas

    20151 citations

    Semantic Scholar

    Save

47. Partitioning a graph into disjoint cliques and a triangle-free graph

    Faisal N. Abu-Khzam, Carl Feghali, H. Müller

    2014Discrete Applied Mathematics1 citations Open access

    Semantic Scholar

    Save

48. Greedy Coloring and Simple Exponential Strengthenings of Brooks-Type Theorems

    A. Crane, Carl Feghali, Felicia Lucke, Blair D. Sullivan +1 more

    20260 citations

    Semantic Scholar

    Save

49. Three remarks on W2 graphs

    Carl Feghali, Malory Marin

    2023arXiv.org0 citations Open access

    Semantic Scholar

    Save

50. On a problem of Cranston and Mahmoud

    Dibyayan Chakraborty, Carl Feghali

    20220 citations

    Semantic Scholar

    Save