A Reconfigurations Analogue of Brooks' Theorem. - Carl Feghali; Matthew Johnson 002; Daniël Paulusma (MFCS (2), 2014)

Forbidden subgraph characterization of (P3-free, K3-free)-colourable cographs. - Carl Feghali; Faisal N. Abu-Khzam; Haiko Müller (CoRR, 2014)

Partitioning a graph into disjoint cliques and a triangle-free graph. - Faisal N. Abu-Khzam; Carl Feghali; Haiko Müller (Discret. Appl. Math., 2015)

Kempe Equivalence of Colourings of Cubic Graphs. - Carl Feghali; Matthew Johnson 002; Daniël Paulusma (Electron. Notes Discret. Math., 2015)

A Reconfigurations Analogue of Brooks' Theorem and Its Consequences. - Carl Feghali; Matthew Johnson 002; Daniël Paulusma (J. Graph Theory, 2016)

Independent Feedback Vertex Set for P_5-free Graphs. - Marthe Bonamy; Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Daniël Paulusma (ISAAC, 2017)

Recognizing Graphs Close to Bipartite Graphs. - Marthe Bonamy; Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Daniël Paulusma (MFCS, 2017)

Towards Cereceda's conjecture for planar graphs. - Eduard Eiben; Carl Feghali (CoRR, 2018)

Erdős-Ko-Rado theorems for a family of trees. - Carl Feghali; Matthew Johnson 002; Daniel Thomas (Discret. Appl. Math., 2018)

Independent feedback vertex sets for graphs of bounded diameter. - Marthe Bonamy; Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Daniël Paulusma (Inf. Process. Lett., 2018)

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. - Carl Feghali; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma (FCT, 2019)

Cyclability in Graph Classes. - Christophe Crespelle; Carl Feghali; Petr A. Golovach (ISAAC, 2019)

Independent Feedback Vertex Set for P5-Free Graphs. - Marthe Bonamy; Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Daniël Paulusma (Algorithmica, 2019)

Reconfiguring colourings of graphs with bounded maximum average degree. - Carl Feghali (CoRR, 2019)

Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations. - John Asplund; Pierre Charbit; Carl Feghali (Discret. Math., 2019)

Paths between colourings of sparse graphs. - Carl Feghali (Eur. J. Comb., 2019)

Paths between colourings of graphs with bounded tree-width. - Carl Feghali (Inf. Process. Lett., 2019)

On a conjecture of Mohar concerning Kempe equivalence of regular graphs. - Marthe Bonamy; Nicolas Bousquet 001; Carl Feghali; Matthew Johnson 002 (J. Comb. Theory B, 2019)

Intersecting families, signed sets, and injection. - Carl Feghali (Australas. J Comb., 2020)

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. - Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Giacomo Paesani; Daniël Paulusma; Pawel Rzazewski (Algorithmica, 2020)

An Update on Reconfiguring $10$-Colorings of Planar Graphs. - Zdenek Dvorák 001; Carl Feghali (Electron. J. Comb., 2020)

Reconfiguration graph for vertex colourings of weakly chordal graphs. - Carl Feghali; Jirí Fiala 001 (Discret. Math., 2020)

An Erdős-Ko-Rado theorem for unions of length 2 paths. - Carl Feghali; Glenn Hurlbert; Vikram Kamat (Discret. Math., 2020)

Partitioning a graph into degenerate subgraphs. - Faisal N. Abu-Khzam; Carl Feghali; Pinar Heggernes (Eur. J. Comb., 2020)

Reconfiguring 10-Colourings of Planar Graphs. - Carl Feghali (Graphs Comb., 2020)

Toward Cereceda's conjecture for planar graphs. - Eduard Eiben; Carl Feghali (J. Graph Theory, 2020)

Mixing colourings in 2K2-free graphs. - Carl Feghali; Owen D. Merkel (CoRR, 2021)

A note on Matching-Cut in Pt-free Graphs. - Carl Feghali (CoRR, 2021)

A Thomassen-type method for planar graph recoloring. - Zdenek Dvorák 001; Carl Feghali (Eur. J. Comb., 2021)

Reconfiguring colorings of graphs with bounded maximum average degree. - Carl Feghali (J. Comb. Theory B, 2021)

Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. - Marthe Bonamy; Konrad K. Dabrowski; Carl Feghali; Matthew Johnson 002; Daniël Paulusma (J. Graph Theory, 2021)

New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching. - Carl Feghali; Felicia Lucke; Daniël Paulusma; Bernard Ries (CoRR, 2022)

The maximum sum of sizes of cross-intersecting families of subsets of a set. - Peter Borg; Carl Feghali (Discret. Math., 2022)

Mixing colourings in 2K2-free graphs. - Carl Feghali; Owen D. Merkel (Discret. Math., 2022)

A short proof of Talbot's theorem for intersecting separated sets. - Peter Borg; Carl Feghali (Eur. J. Comb., 2022)

Three remarks on W2 graphs. - Carl Feghali; Malory Marin (CoRR, 2023)

The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem. - Peter Borg; Carl Feghali (Discuss. Math. Graph Theory, 2023)

A note on matching-cut in Pt-free graphs. - Carl Feghali (Inf. Process. Lett., 2023)

Recoloring Planar Graphs of Girth at Least Five. - Valentin Bartier; Nicolas Bousquet 001; Carl Feghali; Marc Heinrich; Benjamin Moore; Théo Pierron (SIAM J. Discret. Math., 2023)

Kempe equivalence of 4-critical planar graphs. - Carl Feghali (J. Graph Theory, 2023)

Strengthening a Theorem of Meyniel. - Quentin Deschamps; Carl Feghali; Frantisek Kardos; Clément Legrand-Duchesne; Théo Pierron (SIAM J. Discret. Math., 2023)

Partitioning into degenerate graphs in linear time. - Timothée Corsini; Quentin Deschamps; Carl Feghali; Daniel Gonçalves; Hélène Langlois; Alexandre Talon (Eur. J. Comb., 2023)

Beyond Recognizing Well-Covered Graphs. - Carl Feghali; Malory Marin; Rémi Watrigant (WG, 2024)

Graphs without a 3-connected subgraph are 4-colorable. - Édouard Bonnet; Carl Feghali; Stéphan Thomassé; Nicolas Trotignon (CoRR, 2024)

Kempe classes and almost bipartite graphs. - Daniel W. Cranston; Carl Feghali (Discret. Appl. Math., 2024)

Kempe equivalent list colorings revisited. - Dibyayan Chakraborty; Carl Feghali; Reem Mahmoud (J. Graph Theory, 2024)

Another Proof of Euler's Circuit Theorem. - Carl Feghali (Am. Math. Mon., 2024)

Three remarks on W graphs. - Carl Feghali; Malory Marin (Theor. Comput. Sci., 2024)

Decomposing a triangle-free planar graph into a forest and a subcubic forest. - Carl Feghali; Robert Sámal (Eur. J. Comb., 2024)

1-Extendability of Independent Sets. - Pierre Bergé; Anthony Busson; Carl Feghali; Rémi Watrigant (Algorithmica, 2024)

Solution to a problem of Katona on counting cliques of weighted graphs. - Peter Borg; Carl Feghali; Rémi Pellerin (Discret. Appl. Math., 2024)

Dirac's theorem on chordal graphs implies Brooks' theorem. - Carl Feghali (Discret. Math., 2024)

Solution to a Problem of Grünbaum on the Edge Density of 4-Critical Planar Graphs. - Zdenek Dvorák 001; Carl Feghali (Comb., 2024)

Graphs without a 3-Connected Subgraph are 4-Colourable. - Édouard Bonnet; Carl Feghali; Tung Nguyen 004; Alex Scott 001; Paul D. Seymour; Stéphan Thomassé; Nicolas Trotignon (Electron. J. Comb., 2025)

Matching Cuts in Graphs of High Girth and H-Free Graphs. - Carl Feghali; Felicia Lucke; Daniël Paulusma; Bernard Ries (Algorithmica, 2025)