Carl Feghali
Introduction
I am a postdoctoral researcher at the Computer Science Institute of the Faculty of Mathematics and Physics of Charles University.
A brief Curriculum Vitae. Contact info: feghali.carl@gmail.com
Research interests
Graph theory and Combinatorics.
Papers
- (with G. Hurlbert, V. Kamat) An Erdos-Ko-Rado Theorem for unions of length 2 paths, submitted.
- (with K. Dabrowski, M. Johnson, G. Paesani, D. Paulusma, P. Rzazewski) On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest, submitted.
- (with P. Borg) On the Hilton-Spencer intersection theorems for unions of cycles , submitted.
- Reconfiguring colourings of graphs with bounded maximum average degree, submitted.
- Reconfiguring 10-colourings of planar graphs, submitted
- (with M. Bonamy, K. Dabrowski, M. Johnson and D. Paulusma)
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration , submitted
- Intersecting families, signed sets, and injection
Australasian Journal of Combinatorics, to appear.
- (with J. Fiala) Reconfiguration graph for vertex colourings of weakly chordal graphs,
Discrete Mathematics, to appear.
- (with E. Eiben), Towards Cereceda's conjecture for planar graphs.,
Journal of Graph Theory, to appear.
- (with F. N. Abu-Khzam and P. Heggernes),
Partitioning a graph into degenerate subgraphs,
European Journal of Combinatorics, 23 (2020) 103015.
- (with J. Asplund and P. Charbit),
Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations,
Discrete Mathematics 342 (2019) 2195-2203.
- (with M. Bonamy, K. Dabrowski, M. Johnson and D. Paulusma)
Independent feedback vertex set for P5-free graphs,
Algorithmica 81 (2019) 1342-1369.
- Paths between colourings of graphs with bounded tree-width
Information Processing Letters 144 (2019) 37-38.
- (with M. Bonamy, N. Bousquet and M. Johnson)
On a conjecture of Mohar concerning Kempe equivalence of regular graphs,
Journal of Combinatorial Theory Series B 135 (2019) 179-199.
- Paths between colourings of sparse graphs,
European Journal of Combinatorics 75 (2019), 169-171.
doi
- (with M. Johnson)
Enclosings of decompositions of complete multigraphs in 2-factorizations,
Journal of Combinatorial Designs 26 (2018), 205-218.
doi
- (with M. Johnson and D. Thomas)
Erdos-Ko-Rado theorems for a family of trees,
Discrete Applied Mathematics 236 (2018), 464-471.
doi
- (with M. Bonamy, K. Dabrowski, M. Johnson and D. Paulusma)
Independent feedback vertex sets for graphs of bounded diameter,
Information Processing Letters 131 (2018), 26-32.doi
- (with M. Johnson and D. Paulusma)
A reconfigurations analogue of Brooks' theorem and its consequences,
Journal of Graph Theory 83 (2016), 340-358.
doi
- (with M. Johnson and D. Paulusma)
Kempe equivalence of colourings of cubic graphs,
European Journal of Combinatorics 59 (2017), 1-10.
doi
- (with F. N. Abu-Khzam and H. Muller)
Partitioning a graph into disjoint cliques and a triangle-free graph,
Discrete Applied Mathematics 190-191 (2015), 1-12. doi
Conference proceedings
- (with C. Crespelle, P. A. Golovach) Cyclability in graph classes,
Proceedings of ISAAC 2019, to appear.
- (with J. Fiala),
Reconfiguration graph for vertex colourings of weakly chordal graphs,
Proceedings of EuroComb 2019.
- (with M. Johnson, G. Paesani, D. Paulusma),
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest,
Proceedings of FCT 2019.
- (with M. Bonamy, K. Dabrowski, M. Johnson and D. Paulusma),
Independent feedback vertex set for P5-free graphs,
Proceedings of ISAAC 2017, LIPIcs.
- (with M. Bonamy, K. Dabrowski, M. Johnson and D. Paulusma),
Recognizing graphs close to bipartite graphs,
Proceedings of MFCS 2017, LIPIcs.
- (with M. Johnson and D. Paulusma),
Kempe equivalence of colourings of cubic graphs,
Proceedings of EuroComb 2015, ENDM.
- (with M. Johnson and D. Paulusma),
A reconfigurations analogue of Brooks' theorem,
Proceedings of MFCS 2014, LNCS.
|