Carl Feghali

Orcid: 0000-0001-6727-7213

According to our database1, Carl Feghali authored at least 53 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Solution to a Problem of Grünbaum on the Edge Density of 4-Critical Planar Graphs.
Comb., August, 2024

Dirac's theorem on chordal graphs implies Brooks' theorem.
Discret. Math., March, 2024

Solution to a problem of Katona on counting cliques of weighted graphs.
Discret. Appl. Math., March, 2024

1-Extendability of Independent Sets.
Algorithmica, March, 2024

Decomposing a triangle-free planar graph into a forest and a subcubic forest.
Eur. J. Comb., February, 2024

Three remarks on W graphs.
Theor. Comput. Sci., 2024

Another Proof of Euler's Circuit Theorem.
Am. Math. Mon., 2024

Kempe classes and almost bipartite graphs.
Discret. Appl. Math., 2024

Beyond recognizing well-covered graphs.
CoRR, 2024

Graphs without a 3-connected subgraph are 4-colorable.
CoRR, 2024

2023
Partitioning into degenerate graphs in linear time.
Eur. J. Comb., December, 2023

Strengthening a Theorem of Meyniel.
SIAM J. Discret. Math., June, 2023

Kempe equivalence of 4-critical planar graphs.
J. Graph Theory, May, 2023

Recoloring Planar Graphs of Girth at Least Five.
SIAM J. Discret. Math., March, 2023

A note on matching-cut in <i>P</i><sub><i>t</i></sub>-free graphs.
Inf. Process. Lett., 2023

The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem.
Discuss. Math. Graph Theory, 2023

Three remarks on W<sub>2</sub> graphs.
CoRR, 2023

Matching Cuts in Graphs of High Girth and H-Free Graphs.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022
A short proof of Talbot's theorem for intersecting separated sets.
Eur. J. Comb., 2022

Mixing colourings in 2<i>K</i><sub>2</sub>-free graphs.
Discret. Math., 2022

The maximum sum of sizes of cross-intersecting families of subsets of a set.
Discret. Math., 2022

New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching.
CoRR, 2022

2021
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration.
J. Graph Theory, 2021

Reconfiguring colorings of graphs with bounded maximum average degree.
J. Comb. Theory B, 2021

A Thomassen-type method for planar graph recoloring.
Eur. J. Comb., 2021

A note on Matching-Cut in P<sub>t</sub>-free Graphs.
CoRR, 2021

Mixing colourings in 2K<sub>2</sub>-free graphs.
CoRR, 2021

2020
Toward Cereceda's conjecture for planar graphs.
J. Graph Theory, 2020

Reconfiguring 10-Colourings of Planar Graphs.
Graphs Comb., 2020

Partitioning a graph into degenerate subgraphs.
Eur. J. Comb., 2020

An Erdős-Ko-Rado theorem for unions of length 2 paths.
Discret. Math., 2020

Reconfiguration graph for vertex colourings of weakly chordal graphs.
Discret. Math., 2020

An Update on Reconfiguring $10$-Colorings of Planar Graphs.
Electron. J. Comb., 2020

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

Intersecting families, signed sets, and injection.
Australas. J Comb., 2020

2019
On a conjecture of Mohar concerning Kempe equivalence of regular graphs.
J. Comb. Theory B, 2019

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

Paths between colourings of sparse graphs.
Eur. J. Comb., 2019

Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations.
Discret. Math., 2019

Reconfiguring colourings of graphs with bounded maximum average degree.
CoRR, 2019

Independent Feedback Vertex Set for P<sub>5</sub>-Free Graphs.
Algorithmica, 2019

Cyclability in Graph Classes.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest.
Proceedings of the Fundamentals of Computation Theory - 22nd International Symposium, 2019

2018
Independent feedback vertex sets for graphs of bounded diameter.
Inf. Process. Lett., 2018

Erdős-Ko-Rado theorems for a family of trees.
Discret. Appl. Math., 2018

Towards Cereceda's conjecture for planar graphs.
CoRR, 2018

2017
Recognizing Graphs Close to Bipartite Graphs.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Independent Feedback Vertex Set for P_5-free Graphs.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

2016
A Reconfigurations Analogue of Brooks' Theorem and Its Consequences.
J. Graph Theory, 2016

2015
Kempe Equivalence of Colourings of Cubic Graphs.
Electron. Notes Discret. Math., 2015

Partitioning a graph into disjoint cliques and a triangle-free graph.
Discret. Appl. Math., 2015

2014
Forbidden subgraph characterization of (P<sub>3</sub>-free, K<sub>3</sub>-free)-colourable cographs.
CoRR, 2014

A Reconfigurations Analogue of Brooks' Theorem.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014


  Loading...