Carl Feghali

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Reconfiguration graph for vertex colourings of weakly chordal graphs Acta Mathematica Universitatis Comenianae. New Series	2024-10-18	Paper
Kempe classes and almost bipartite graphs Discrete Applied Mathematics	2024-09-26	Paper
Solution to a problem of Grünbaum on the edge density of 4-critical planar graphs Combinatorica	2024-09-19	Paper
Kempe equivalent list colorings revisited Journal of Graph Theory	2024-09-16	Paper
1-extendability of independent sets Algorithmica	2024-03-25	Paper
Three remarks on $\mathbf{W}_{\mathbf{2}}$ graphs Theoretical Computer Science	2024-02-20	Paper
Another Proof of Euler’s Circuit Theorem The American Mathematical Monthly	2024-02-08	Paper
Decomposing a triangle-free planar graph into a forest and a subcubic forest European Journal of Combinatorics	2024-02-05	Paper
Dirac's theorem on chordal graphs implies Brooks' theorem Discrete Mathematics	2024-01-17	Paper
Solution to a problem of Katona on counting cliques of weighted graphs Discrete Applied Mathematics	2024-01-09	Paper
Solution to a problem of Gr\"unbaum on the edge density of $4$-critical planar graphs	2023-11-06	Paper
Kempe equivalence of 4‐critical planar graphs Journal of Graph Theory	2023-10-09	Paper
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration Journal of Graph Theory	2023-10-04	Paper
Strengthening a Theorem of Meyniel SIAM Journal on Discrete Mathematics	2023-05-31	Paper
Recoloring Planar Graphs of Girth at Least Five SIAM Journal on Discrete Mathematics	2023-03-30	Paper
Kempe Classes and Almost Bipartite Graphs	2023-03-16	Paper
scientific article; zbMATH DE number 7650249 (Why is no real title available?)	2023-02-03	Paper
Matching Cuts in Graphs of High Girth and H-Free Graphs	2022-12-23	Paper
The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem Discussiones Mathematicae Graph Theory	2022-12-02	Paper
A note on matching-cut in $P_t$-free graphs Information Processing Letters	2022-10-28	Paper
1-extendability of independent sets (available as arXiv preprint)	2022-08-30	Paper
The maximum sum of sizes of cross-intersecting families of subsets of a set Discrete Mathematics	2022-08-24	Paper
Mixing colourings in $2K_2$-free graphs Discrete Mathematics	2022-08-24	Paper
A short proof of Talbot's theorem for intersecting separated sets European Journal of Combinatorics	2022-01-13	Paper
Recolouring planar graphs of girth at least five (available as arXiv preprint)	2021-12-01	Paper
A note on Matching-Cut in $P_t$-free Graphs (available as arXiv preprint)	2021-11-23	Paper
A Thomassen-type method for planar graph recoloring European Journal of Combinatorics	2021-06-18	Paper
Reconfiguring 10-colourings of planar graphs Graphs and Combinatorics	2021-03-17	Paper
Reconfiguring colorings of graphs with bounded maximum average degree Journal of Combinatorial Theory. Series B	2021-02-03	Paper
An update on reconfiguring 10-colorings of planar graphs The Electronic Journal of Combinatorics	2021-01-29	Paper
Independent Feedback Vertex Set for P_5-free Graphs	2020-11-25	Paper
On cycle transversals and their connected variants in the absence of a small linear forest Algorithmica	2020-10-12	Paper
An Erdős-Ko-Rado theorem for unions of length 2 paths Discrete Mathematics	2020-10-08	Paper
Recognizing Graphs Close to Bipartite Graphs	2020-05-26	Paper
Toward Cereceda's conjecture for planar graphs Journal of Graph Theory	2020-05-21	Paper
Intersecting families, signed sets, and injection	2020-05-07	Paper
Intersecting families, signed sets, and injection (available as arXiv preprint)	2020-05-07	Paper
On cycle transversals and their connected variants in the absence of a small linear forest Fundamentals of Computation Theory	2020-01-30	Paper
On cycle transversals and their connected variants in the absence of a small linear forest Fundamentals of Computation Theory	2020-01-30	Paper
Reconfiguration graph for vertex colourings of weakly chordal graphs Discrete Mathematics	2020-01-22	Paper
Partitioning a graph into degenerate subgraphs European Journal of Combinatorics	2019-11-28	Paper
On the Hilton-Spencer intersection theorems for unions of cycles	2019-08-23	Paper
Enclosings of decompositions of complete multigraphs in 2-edge-connected $r$-factorizations Discrete Mathematics	2019-08-20	Paper
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest (available as arXiv preprint)	2019-08-01	Paper
Independent feedback vertex set for $P_5$-free graphs Algorithmica	2019-04-25	Paper
Paths between colourings of graphs with bounded tree-width Information Processing Letters	2019-02-13	Paper
On a conjecture of Mohar concerning Kempe equivalence of regular graphs Journal of Combinatorial Theory. Series B	2019-02-08	Paper
On a conjecture of Mohar concerning Kempe equivalence of regular graphs Journal of Combinatorial Theory. Series B	2019-02-08	Paper
Paths between colourings of sparse graphs European Journal of Combinatorics	2018-11-15	Paper
The Erd\H{o}s-Ko-Rado property of trees of depth two	2018-11-12	Paper
Enclosings of decompositions of complete multigraphs in 2-factorizations Journal of Combinatorial Designs	2018-10-05	Paper
Enclosings of decompositions of complete multigraphs in 2-factorizations Journal of Combinatorial Designs	2018-10-05	Paper
Intersecting non-uniform families containing subfamilies	2017-12-28	Paper
Independent feedback vertex sets for graphs of bounded diameter Information Processing Letters	2017-12-13	Paper
A reconfigurations analogue of Brooks' theorem and its consequences Journal of Graph Theory	2016-11-17	Paper
A reconfigurations analogue of Brooks' theorem and its consequences Journal of Graph Theory	2016-11-17	Paper
Kempe equivalence of colourings of cubic graphs Electronic Notes in Discrete Mathematics	2016-10-14	Paper
Kempe equivalence of colourings of cubic graphs Electronic Notes in Discrete Mathematics	2016-10-14	Paper
Kempe equivalence of colourings of cubic graphs European Journal of Combinatorics	2016-10-12	Paper
Partitioning a graph into disjoint cliques and a triangle-free graph Discrete Applied Mathematics	2015-07-06	Paper
A reconfigurations analogue of Brooks' theorem Mathematical Foundations of Computer Science 2014	2014-10-14	Paper
Kempe Equivalent List Colorings Revisited (available as arXiv preprint)	N/A	Paper
Graphs without a 3-connected subgraph are 4-colorable (available as arXiv preprint)	N/A	Paper
Beyond recognizing well-covered graphs (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: Carl Feghali