default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarl Feghali
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j39]Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant:
1-Extendability of Independent Sets. Algorithmica 86(3): 757-781 (2024)- [j38]Zdenek Dvorák, Carl Feghali:
Solution to a Problem of Grünbaum on the Edge Density of 4-Critical Planar Graphs. Comb. 44(4): 897-907 (2024) - [j37]Peter Borg
, Carl Feghali, Rémi Pellerin:
Solution to a problem of Katona on counting cliques of weighted graphs. Discret. Appl. Math. 345: 147-155 (2024) - [j36]Daniel W. Cranston, Carl Feghali:
Kempe classes and almost bipartite graphs. Discret. Appl. Math. 357: 94-98 (2024) - [j35]Carl Feghali:
Dirac's theorem on chordal graphs implies Brooks' theorem. Discret. Math. 347(3): 113791 (2024) - [j34]Carl Feghali, Robert Sámal:
Decomposing a triangle-free planar graph into a forest and a subcubic forest. Eur. J. Comb. 116: 103878 (2024) - [j33]Carl Feghali:
Another Proof of Euler's Circuit Theorem. Am. Math. Mon. 131(2): 164 (2024) - [j32]Carl Feghali, Malory Marin:
Three remarks on W graphs. Theor. Comput. Sci. 990: 114403 (2024) - [i25]Édouard Bonnet, Carl Feghali, Stéphan Thomassé, Nicolas Trotignon:
Graphs without a 3-connected subgraph are 4-colorable. CoRR abs/2402.06338 (2024) - [i24]Carl Feghali, Malory Marin, Rémi Watrigant:
Beyond recognizing well-covered graphs. CoRR abs/2404.07853 (2024) - 2023
- [j31]Peter Borg, Carl Feghali:
The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem. Discuss. Math. Graph Theory 43(1): 277-286 (2023) - [j30]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: 103771 (2023) - [j29]Carl Feghali:
A note on matching-cut in Pt-free graphs. Inf. Process. Lett. 179: 106294 (2023) - [j28]Carl Feghali:
Kempe equivalence of 4-critical planar graphs. J. Graph Theory 103(1): 139-147 (2023) - [j27]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): 332-350 (2023) - [j26]Quentin Deschamps, Carl Feghali, Frantisek Kardos, Clément Legrand-Duchesne, Théo Pierron:
Strengthening a Theorem of Meyniel. SIAM J. Discret. Math. 37(2): 604-611 (2023) - [c7]Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries:
Matching Cuts in Graphs of High Girth and H-Free Graphs. ISAAC 2023: 31:1-31:16 - [i23]Carl Feghali, Malory Marin:
Three remarks on W2 graphs. CoRR abs/2307.15573 (2023) - 2022
- [j25]Peter Borg, Carl Feghali:
The maximum sum of sizes of cross-intersecting families of subsets of a set. Discret. Math. 345(11): 112981 (2022) - [j24]Carl Feghali, Owen D. Merkel:
Mixing colourings in 2K2-free graphs. Discret. Math. 345(11): 113108 (2022) - [j23]Peter Borg, Carl Feghali:
A short proof of Talbot's theorem for intersecting separated sets. Eur. J. Comb. 101: 103471 (2022) - [c6]Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant:
1-Extendability of Independent Sets. IWOCA 2022: 172-185 - [i22]Quentin Deschamps, Carl Feghali, Frantisek Kardos, Clément Legrand-Duchesne, Théo Pierron:
Strengthening a theorem of Meyniel. CoRR abs/2201.07595 (2022) - [i21]Pierre Bergé, Anthony Busson, Carl Feghali, Rémi Watrigant:
1-Extendability of independent sets. CoRR abs/2204.05809 (2022) - [i20]Timothée Corsini, Quentin Deschamps, Carl Feghali, Daniel Gonçalves, Hélène Langlois, Alexandre Talon:
Partitioning into degenerate graphs in linear time. CoRR abs/2204.11100 (2022) - [i19]Peter Borg, Carl Feghali, Rémi Pellerin:
Solution to a problem of Katona on counting cliques of weighted graphs. CoRR abs/2211.04153 (2022) - [i18]Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries:
New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching. CoRR abs/2212.12317 (2022) - 2021
- [j22]Zdenek Dvorák, Carl Feghali:
A Thomassen-type method for planar graph recoloring. Eur. J. Comb. 95: 103319 (2021) - [j21]Carl Feghali:
Reconfiguring colorings of graphs with bounded maximum average degree. J. Comb. Theory B 147: 133-138 (2021) - [j20]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): 81-109 (2021) - [i17]Carl Feghali, Owen D. Merkel:
Mixing colourings in 2K2-free graphs. CoRR abs/2108.00001 (2021) - [i16]Carl Feghali:
A note on Matching-Cut in Pt-free Graphs. CoRR abs/2111.12011 (2021) - 2020
- [j19]Carl Feghali:
Intersecting families, signed sets, and injection. Australas. J Comb. 76: 226-231 (2020) - [j18]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): 2841-2866 (2020) - [j17]Zdenek Dvorák, Carl Feghali:
An Update on Reconfiguring $10$-Colorings of Planar Graphs. Electron. J. Comb. 27(4): 4 (2020) - [j16]Carl Feghali, Jirí Fiala:
Reconfiguration graph for vertex colourings of weakly chordal graphs. Discret. Math. 343(3): 111733 (2020) - [j15]Carl Feghali, Glenn Hurlbert, Vikram Kamat:
An Erdős-Ko-Rado theorem for unions of length 2 paths. Discret. Math. 343(12): 112121 (2020) - [j14]Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes:
Partitioning a graph into degenerate subgraphs. Eur. J. Comb. 83 (2020) - [j13]Carl Feghali:
Reconfiguring 10-Colourings of Planar Graphs. Graphs Comb. 36(6): 1815-1818 (2020) - [j12]Eduard Eiben, Carl Feghali:
Toward Cereceda's conjecture for planar graphs. J. Graph Theory 94(2): 267-277 (2020) - [i15]Peter Borg, Carl Feghali:
The maximum sum of sizes of cross-intersecting families of subsets of a set. CoRR abs/2012.15356 (2020)
2010 – 2019
- 2019
- [j11]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Set for P5-Free Graphs. Algorithmica 81(4): 1342-1369 (2019) - [j10]John Asplund, Pierre Charbit, Carl Feghali:
Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations. Discret. Math. 342(8): 2195-2203 (2019) - [j9]Carl Feghali:
Paths between colourings of sparse graphs. Eur. J. Comb. 75: 169-171 (2019) - [j8]Carl Feghali:
Paths between colourings of graphs with bounded tree-width. Inf. Process. Lett. 144: 37-38 (2019) - [j7]Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson:
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. J. Comb. Theory B 135: 179-199 (2019) - [c5]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: 258-273 - [c4]Christophe Crespelle, Carl Feghali, Petr A. Golovach:
Cyclability in Graph Classes. ISAAC 2019: 16:1-16:13 - [i14]Carl Feghali:
Reconfiguring 10-colourings of planar graphs. CoRR abs/1902.02278 (2019) - [i13]Carl Feghali, Jirí Fiala:
Reconfiguration Graph for Vertex Colourings of Weakly Chordal Graphs. CoRR abs/1902.08071 (2019) - [i12]Carl Feghali:
Reconfiguring colourings of graphs with bounded maximum average degree. CoRR abs/1904.12698 (2019) - [i11]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 abs/1908.00491 (2019) - 2018
- [j6]Carl Feghali, Matthew Johnson, Daniel Thomas:
Erdős-Ko-Rado theorems for a family of trees. Discret. Appl. Math. 236: 464-471 (2018) - [j5]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: 26-32 (2018) - [i10]Carl Feghali:
Paths between colourings of sparse graphs. CoRR abs/1803.03950 (2018) - [i9]Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes:
Partitioning a graph into degenerate subgraphs. CoRR abs/1803.04388 (2018) - [i8]Eduard Eiben, Carl Feghali:
Towards Cereceda's conjecture for planar graphs. CoRR abs/1810.00731 (2018) - 2017
- [j4]Carl Feghali, Matthew Johnson, Daniël Paulusma:
Kempe equivalence of colourings of cubic graphs. Eur. J. Comb. 59: 1-10 (2017) - [c3]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Set for P_5-free Graphs. ISAAC 2017: 16:1-16:12 - [c2]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Recognizing Graphs Close to Bipartite Graphs. MFCS 2017: 70:1-70:14 - [i7]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Sets for Graphs of Bounded Diameter. CoRR abs/1707.09383 (2017) - [i6]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Set for $P_5$-free Graphs. CoRR abs/1707.09402 (2017) - [i5]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 abs/1707.09817 (2017) - 2016
- [j3]Carl Feghali, Matthew Johnson, Daniël Paulusma:
A Reconfigurations Analogue of Brooks' Theorem and Its Consequences. J. Graph Theory 83(4): 340-358 (2016) - 2015
- [j2]Faisal N. Abu-Khzam, Carl Feghali, Haiko Müller:
Partitioning a graph into disjoint cliques and a triangle-free graph. Discret. Appl. Math. 190-191: 1-12 (2015) - [j1]Carl Feghali, Matthew Johnson, Daniël Paulusma:
Kempe Equivalence of Colourings of Cubic Graphs. Electron. Notes Discret. Math. 49: 243-249 (2015) - [i4]Carl Feghali, Matthew Johnson, Daniël Paulusma:
A Reconfigurations Analogue of Brooks' Theorem and its Consequences. CoRR abs/1501.05800 (2015) - [i3]Carl Feghali, Matthew Johnson, Daniël Paulusma:
Kempe Equivalence of Colourings of Cubic Graphs. CoRR abs/1503.03430 (2015) - [i2]Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson:
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. CoRR abs/1510.06964 (2015) - 2014
- [c1]Carl Feghali, Matthew Johnson, Daniël Paulusma:
A Reconfigurations Analogue of Brooks' Theorem. MFCS (2) 2014: 287-298 - [i1]Carl Feghali, Faisal N. Abu-Khzam, Haiko Müller:
Forbidden subgraph characterization of (P3-free, K3-free)-colourable cographs. CoRR abs/1403.5961 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
