Carl Feghali - RankMe

77 papers B 6C 1Journal 69Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability. Discret. Appl. Math. Carl Feghali, Hoàng-Oanh Le, Van Bang Le
2025	J	`jnl`	Graphs without a 3-Connected Subgraph are 4-Colourable. Electron. J. Comb. Édouard Bonnet, Carl Feghali, Tung Nguyen, Alex Scott, Paul D. Seymour, Stéphan Thomassé, Nicolas Trotignon
2025	J	`jnl`	Matching Cuts in Graphs of High Girth and H-Free Graphs. Algorithmica Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
2025	J	`jnl`	The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability. CoRR Carl Feghali, Hoàng-Oanh Le, Van Bang Le
2024	J	`jnl`	1-Extendability of Independent Sets. Algorithmica Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant
2024	J	`jnl`	Another Proof of Euler's Circuit Theorem. Am. Math. Mon. Carl Feghali
2024	B	`conf`	Beyond Recognizing Well-Covered Graphs. WG Carl Feghali, Malory Marin, Rémi Watrigant
2024	J	`jnl`	Beyond recognizing well-covered graphs. CoRR Carl Feghali, Malory Marin, Rémi Watrigant
2024	J	`jnl`	Decomposing a triangle-free planar graph into a forest and a subcubic forest. Eur. J. Comb. Carl Feghali, Robert Sámal
2024	J	`jnl`	Dirac's theorem on chordal graphs implies Brooks' theorem. Discret. Math. Carl Feghali
2024	J	`jnl`	Graphs without a 3-connected subgraph are 4-colorable. CoRR Édouard Bonnet, Carl Feghali, Stéphan Thomassé, Nicolas Trotignon
2024	J	`jnl`	Kempe classes and almost bipartite graphs. Discret. Appl. Math. Daniel W. Cranston, Carl Feghali
2024	J	`jnl`	Kempe equivalent list colorings revisited. J. Graph Theory Dibyayan Chakraborty, Carl Feghali, Reem Mahmoud
2024	J	`jnl`	Solution to a Problem of Grünbaum on the Edge Density of 4-Critical Planar Graphs. Comb. Zdenek Dvorák, Carl Feghali
2024	J	`jnl`	Solution to a problem of Katona on counting cliques of weighted graphs. Discret. Appl. Math. Peter Borg, Carl Feghali, Rémi Pellerin
2024	J	`jnl`	Three remarks on W graphs. Theor. Comput. Sci. Carl Feghali, Malory Marin
2023	J	`jnl`	A note on matching-cut in Inf. Process. Lett. Carl Feghali
2023	J	`jnl`	Kempe equivalence of 4-critical planar graphs. J. Graph Theory Carl Feghali
2023	B	`conf`	Matching Cuts in Graphs of High Girth and H-Free Graphs. ISAAC Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
2023	J	`jnl`	Partitioning into degenerate graphs in linear time. Eur. J. Comb. Timothée Corsini, Quentin Deschamps, Carl Feghali, Daniel Gonçalves, Hélène Langlois, Alexandre Talon
2023	J	`jnl`	Recoloring Planar Graphs of Girth at Least Five. SIAM J. Discret. Math. Valentin Bartier, Nicolas Bousquet, Carl Feghali, Marc Heinrich, Benjamin R. Moore, Théo Pierron
2023	J	`jnl`	Strengthening a Theorem of Meyniel. SIAM J. Discret. Math. Quentin Deschamps, Carl Feghali, Frantisek Kardos, Clément Legrand-Duchesne, Théo Pierron
2023	J	`jnl`	The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem. Discuss. Math. Graph Theory Peter Borg, Carl Feghali
2023	J	`jnl`	Three remarks on W CoRR Carl Feghali, Malory Marin
2022	C	`conf`	1-Extendability of Independent Sets. IWOCA Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant
2022	J	`jnl`	1-Extendability of independent sets. CoRR Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant
2022	J	`jnl`	A short proof of Talbot's theorem for intersecting separated sets. Eur. J. Comb. Peter Borg, Carl Feghali
2022	J	`jnl`	Mixing colourings in 2 Discret. Math. Carl Feghali, Owen D. Merkel
2022	J	`jnl`	New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching. CoRR Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
2022	J	`jnl`	Partitioning into degenerate graphs in linear time. CoRR Timothée Corsini, Quentin Deschamps, Carl Feghali, Daniel Gonçalves, Hélène Langlois, Alexandre Talon
2022	J	`jnl`	Solution to a problem of Katona on counting cliques of weighted graphs. CoRR Peter Borg, Carl Feghali, Rémi Pellerin
2022	J	`jnl`	Strengthening a theorem of Meyniel. CoRR Quentin Deschamps, Carl Feghali, Frantisek Kardos, Clément Legrand-Duchesne, Théo Pierron
2022	J	`jnl`	The maximum sum of sizes of cross-intersecting families of subsets of a set. Discret. Math. Peter Borg, Carl Feghali
2021	J	`jnl`	A Thomassen-type method for planar graph recoloring. Eur. J. Comb. Zdenek Dvorák, Carl Feghali
2021	J	`jnl`	A note on Matching-Cut in P CoRR Carl Feghali
2021	J	`jnl`	Mixing colourings in 2K CoRR Carl Feghali, Owen D. Merkel
2021	J	`jnl`	Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. J. Graph Theory Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2021	J	`jnl`	Reconfiguring colorings of graphs with bounded maximum average degree. J. Comb. Theory B Carl Feghali
2020	J	`jnl`	An Erdős-Ko-Rado theorem for unions of length 2 paths. Discret. Math. Carl Feghali, Glenn Hurlbert, Vikram Kamat
2020	J	`jnl`	An Update on Reconfiguring $10$-Colorings of Planar Graphs. Electron. J. Comb. Zdenek Dvorák, Carl Feghali
2020	J	`jnl`	Intersecting families, signed sets, and injection. Australas. J Comb. Carl Feghali
2020	J	`jnl`	On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. Algorithmica Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2020	J	`jnl`	Partitioning a graph into degenerate subgraphs. Eur. J. Comb. Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes
2020	J	`jnl`	Reconfiguration graph for vertex colourings of weakly chordal graphs. Discret. Math. Carl Feghali, Jirí Fiala
2020	J	`jnl`	Reconfiguring 10-Colourings of Planar Graphs. Graphs Comb. Carl Feghali
2020	J	`jnl`	The maximum sum of sizes of cross-intersecting families of subsets of a set. CoRR Peter Borg, Carl Feghali
2020	J	`jnl`	Toward Cereceda's conjecture for planar graphs. J. Graph Theory Eduard Eiben, Carl Feghali
2019	B	`conf`	Cyclability in Graph Classes. ISAAC Christophe Crespelle, Carl Feghali, Petr A. Golovach
2019	J	`jnl`	Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations. Discret. Math. John Asplund, Pierre Charbit, Carl Feghali
2019	J	`jnl`	Independent Feedback Vertex Set for P Algorithmica Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2019	B	`conf`	On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. FCT Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma
2019	J	`jnl`	On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest. CoRR Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Giacomo Paesani, Daniël Paulusma, Pawel Rzazewski
2019	J	`jnl`	On a conjecture of Mohar concerning Kempe equivalence of regular graphs. J. Comb. Theory B Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson
2019	J	`jnl`	Paths between colourings of graphs with bounded tree-width. Inf. Process. Lett. Carl Feghali
2019	J	`jnl`	Paths between colourings of sparse graphs. Eur. J. Comb. Carl Feghali
2019	J	`jnl`	Reconfiguration Graph for Vertex Colourings of Weakly Chordal Graphs. CoRR Carl Feghali, Jirí Fiala
2019	J	`jnl`	Reconfiguring 10-colourings of planar graphs. CoRR Carl Feghali
2019	J	`jnl`	Reconfiguring colourings of graphs with bounded maximum average degree. CoRR Carl Feghali
2018	J	`jnl`	Erdős-Ko-Rado theorems for a family of trees. Discret. Appl. Math. Carl Feghali, Matthew Johnson, Daniel Thomas
2018	J	`jnl`	Independent feedback vertex sets for graphs of bounded diameter. Inf. Process. Lett. Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2018	J	`jnl`	Partitioning a graph into degenerate subgraphs. CoRR Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes
2018	J	`jnl`	Paths between colourings of sparse graphs. CoRR Carl Feghali
2018	J	`jnl`	Towards Cereceda's conjecture for planar graphs. CoRR Eduard Eiben, Carl Feghali
2017	J	`jnl`	Independent Feedback Vertex Set for $P_5$-free Graphs. CoRR Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	B	`conf`	Independent Feedback Vertex Set for P_5-free Graphs. ISAAC Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	J	`jnl`	Independent Feedback Vertex Sets for Graphs of Bounded Diameter. CoRR Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	J	`jnl`	Kempe equivalence of colourings of cubic graphs. Eur. J. Comb. Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	J	`jnl`	Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration. CoRR Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2017	B	`conf`	Recognizing Graphs Close to Bipartite Graphs. MFCS Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
2016	J	`jnl`	A Reconfigurations Analogue of Brooks' Theorem and Its Consequences. J. Graph Theory Carl Feghali, Matthew Johnson, Daniël Paulusma
2015	J	`jnl`	A Reconfigurations Analogue of Brooks' Theorem and its Consequences. CoRR Carl Feghali, Matthew Johnson, Daniël Paulusma
2015	J	`jnl`	Kempe Equivalence of Colourings of Cubic Graphs. CoRR Carl Feghali, Matthew Johnson, Daniël Paulusma
2015	J	`jnl`	Kempe Equivalence of Colourings of Cubic Graphs. Electron. Notes Discret. Math. Carl Feghali, Matthew Johnson, Daniël Paulusma
2015	J	`jnl`	On a conjecture of Mohar concerning Kempe equivalence of regular graphs. CoRR Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson
2015	J	`jnl`	Partitioning a graph into disjoint cliques and a triangle-free graph. Discret. Appl. Math. Faisal N. Abu-Khzam, Carl Feghali, Haiko Müller
2014	—	`conf`	A Reconfigurations Analogue of Brooks' Theorem. MFCS (2) Carl Feghali, Matthew Johnson, Daniël Paulusma
2014	J	`jnl`	Forbidden subgraph characterization of (P CoRR Carl Feghali, Faisal N. Abu-Khzam, Haiko Müller