Carl Feghali

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 64

Top Topics

Computationally Challenging

Influence Spread

Top Venues

J. Graph Theory

Publications

Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant
1-Extendability of Independent Sets. Algorithmica 86 (3) (2024)
Carl Feghali, Malory Marin, Rémi Watrigant
Beyond recognizing well-covered graphs. CoRR (2024)
Carl Feghali
Another Proof of Euler's Circuit Theorem. Am. Math. Mon. 131 (2) (2024)
Zdenek Dvorák, Carl Feghali
Solution to a Problem of Grünbaum on the Edge Density of 4-Critical Planar Graphs. Comb. 44 (4) (2024)
Carl Feghali, Robert Sámal
Decomposing a triangle-free planar graph into a forest and a subcubic forest. Eur. J. Comb. 116 (2024)
Carl Feghali
Dirac's theorem on chordal graphs implies Brooks' theorem. Discret. Math. 347 (3) (2024)
Daniel W. Cranston, Carl Feghali
Kempe classes and almost bipartite graphs. Discret. Appl. Math. 357 (2024)
Édouard Bonnet, Carl Feghali, Stéphan Thomassé, Nicolas Trotignon
Graphs without a 3-connected subgraph are 4-colorable. CoRR (2024)
Carl Feghali, Malory Marin
Three remarks on W graphs. Theor. Comput. Sci. 990 (2024)
Peter Borg, Carl Feghali, Rémi Pellerin
Solution to a problem of Katona on counting cliques of weighted graphs. Discret. Appl. Math. 345 (2024)
Carl Feghali
Kempe equivalence of 4-critical planar graphs. J. Graph Theory 103 (1) (2023)
Carl Feghali, Malory Marin
graphs. CoRR (2023)
Timothée Corsini, Quentin Deschamps, Carl Feghali, Daniel Gonçalves, Hélène Langlois, Alexandre Talon
Partitioning into degenerate graphs in linear time. Eur. J. Comb. 114 (2023)
Peter Borg, Carl Feghali
The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem. Discuss. Math. Graph Theory 43 (1) (2023)
Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
Matching Cuts in Graphs of High Girth and H-Free Graphs. ISAAC (2023)
Quentin Deschamps, Carl Feghali, Frantisek Kardos, Clément Legrand-Duchesne, Théo Pierron
Strengthening a Theorem of Meyniel. SIAM J. Discret. Math. 37 (2) (2023)
Carl Feghali
-free graphs. Inf. Process. Lett. 179 (2023)
Valentin Bartier, Nicolas Bousquet, Carl Feghali, Marc Heinrich, Benjamin Moore, Théo Pierron
Recoloring Planar Graphs of Girth at Least Five. SIAM J. Discret. Math. 37 (1) (2023)
Thimothée Corsini, Quentin Deschamps, Carl Feghali, Daniel Gonçalves, Hélène Langlois, Alexandre Talon
Partitioning into degenerate graphs in linear time. CoRR (2022)
Carl Feghali, Owen D. Merkel
-free graphs. Discret. Math. 345 (11) (2022)
Quentin Deschamps, Carl Feghali, Frantisek Kardos, Clément Legrand-Duchesne, Théo Pierron
Strengthening a theorem of Meyniel. CoRR (2022)
Peter Borg, Carl Feghali
A short proof of Talbot's theorem for intersecting separated sets. Eur. J. Comb. 101 (2022)
Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant
1-Extendability of Independent Sets. IWOCA (2022)
Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant
1-Extendability of independent sets. CoRR (2022)
Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching. CoRR (2022)
Peter Borg, Carl Feghali, Rémi Pellerin
Solution to a problem of Katona on counting cliques of weighted graphs. CoRR (2022)
Peter Borg, Carl Feghali
The maximum sum of sizes of cross-intersecting families of subsets of a set. Discret. Math. 345 (11) (2022)
Zdenek Dvorák, Carl Feghali
A Thomassen-type method for planar graph recoloring. Eur. J. Comb. 95 (2021)
Carl Feghali, Owen D. Merkel
-free graphs. CoRR (2021)
Carl Feghali
-free Graphs. CoRR (2021)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. J. Graph Theory 98 (1) (2021)
Carl Feghali
Reconfiguring colorings of graphs with bounded maximum average degree. J. Comb. Theory, Ser. B 147 (2021)
Carl Feghali, Jirí Fiala
Reconfiguration graph for vertex colourings of weakly chordal graphs. Discret. Math. 343 (3) (2020)
Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes
Partitioning a graph into degenerate subgraphs. Eur. J. Comb. 83 (2020)
Zdenek Dvorák, Carl Feghali
An Update on Reconfiguring $10$-Colorings of Planar Graphs. Electron. J. Comb. 27 (4) (2020)
Eduard Eiben, Carl Feghali
Toward Cereceda's conjecture for planar graphs. J. Graph Theory 94 (2) (2020)
Peter Borg, Carl Feghali
The maximum sum of sizes of cross-intersecting families of subsets of a set. CoRR (2020)
Carl Feghali
Reconfiguring 10-Colourings of Planar Graphs. Graphs Comb. 36 (6) (2020)
Carl Feghali, Glenn Hurlbert, Vikram Kamat
An Erdős-Ko-Rado theorem for unions of length 2 paths. Discret. Math. 343 (12) (2020)
Carl Feghali
Intersecting families, signed sets, and injection. Australas. J Comb. 76 (2020)
Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. Algorithmica 82 (10) (2020)
Carl Feghali
Reconfiguring colourings of graphs with bounded maximum average degree. CoRR (2019)
Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. J. Comb. Theory, Ser. B 135 (2019)
Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. FCT (2019)
Carl Feghali
Paths between colourings of sparse graphs. Eur. J. Comb. 75 (2019)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
-Free Graphs. Algorithmica 81 (4) (2019)
Christophe Crespelle, Carl Feghali, Petr A. Golovach
Cyclability in Graph Classes. ISAAC (2019)
Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. CoRR (2019)
John Asplund, Pierre Charbit, Carl Feghali
Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations. Discret. Math. 342 (8) (2019)
Carl Feghali
Reconfiguring 10-colourings of planar graphs. CoRR (2019)
Carl Feghali, Jirí Fiala
Reconfiguration Graph for Vertex Colourings of Weakly Chordal Graphs. CoRR (2019)
Carl Feghali
Paths between colourings of graphs with bounded tree-width. Inf. Process. Lett. 144 (2019)
Eduard Eiben, Carl Feghali
Towards Cereceda's conjecture for planar graphs. CoRR (2018)
Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes
Partitioning a graph into degenerate subgraphs. CoRR (2018)
Carl Feghali, Matthew Johnson, Daniel Thomas
Erdős-Ko-Rado theorems for a family of trees. Discret. Appl. Math. 236 (2018)
Carl Feghali
Paths between colourings of sparse graphs. CoRR (2018)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Independent feedback vertex sets for graphs of bounded diameter. Inf. Process. Lett. 131 (2018)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Independent Feedback Vertex Set for P_5-free Graphs. ISAAC (2017)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration. CoRR (2017)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Recognizing Graphs Close to Bipartite Graphs. MFCS (2017)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Independent Feedback Vertex Sets for Graphs of Bounded Diameter. CoRR (2017)
Carl Feghali, Matthew Johnson, Daniël Paulusma
Kempe equivalence of colourings of cubic graphs. Eur. J. Comb. 59 (2017)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Independent Feedback Vertex Set for $P_5$-free Graphs. CoRR (2017)
Carl Feghali, Matthew Johnson, Daniël Paulusma
A Reconfigurations Analogue of Brooks' Theorem and Its Consequences. J. Graph Theory 83 (4) (2016)
Carl Feghali, Matthew Johnson, Daniël Paulusma
Kempe Equivalence of Colourings of Cubic Graphs. Electron. Notes Discret. Math. 49 (2015)
Carl Feghali, Matthew Johnson, Daniël Paulusma
A Reconfigurations Analogue of Brooks' Theorem and its Consequences. CoRR (2015)
Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. CoRR (2015)
Carl Feghali, Matthew Johnson, Daniël Paulusma
Kempe Equivalence of Colourings of Cubic Graphs. CoRR (2015)
Faisal N. Abu-Khzam, Carl Feghali, Haiko Müller
Partitioning a graph into disjoint cliques and a triangle-free graph. Discret. Appl. Math. (2015)
Carl Feghali, Faisal N. Abu-Khzam, Haiko Müller
-free)-colourable cographs. CoRR (2014)
Carl Feghali, Matthew Johnson, Daniël Paulusma
A Reconfigurations Analogue of Brooks' Theorem. MFCS (2) (2014)