Department of Informatics Universitetet i Bergen Member of Algorithms Group Email: carl.feghali@uib.no |

I am a postdoctoral researcher at the Department of Informatics, Bergen University under the direction of Pinar Heggernes. Before this I was a postdoctoral researcher at Universite Paris Diderot working with Pierre Charbit. I obtained my PhD from Durham University under the supervision of Matthew Johnson (first) and Daniel Paulusma (second).

Combinatorics, Graph Theory.

- Topics in graph colouring and extremal graph theory, PhD thesis, Durham University (2016). pdf

- Intersecting families in C(X, k) u U C(X - Xi, l), submitted. pdf
- (with F. N. Abu-Khzam and P. Heggernes), Partitioning a graph into degenerate subgraphs, submitted. pdf
- Paths between colourings of sparse graphs, submitted. pdf
- (with J. Asplund and P. Charbit), Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations, submitted.
- (with M. Bonamy, K. Dabrowski, M. Johnson and D. Paulusma), Independent feedback vertex set for P5-free graphs, submitted. pdf
- (with M. Bonamy, K. Dabrowski, M. Johnson and D. Paulusma), Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration, submitted. pdf
- (with M. Bonamy, N. Bousquet and M. Johnson), On a conjecture of Mohar concerning Kempe equivalence of regular graphs, submitted. pdf
- (with M. Johnson), Enclosings of decompositions of complete multigraphs in 2-factorizations,
*Journal of Combinatorial Designs***26**(2018) 205-218. pdf doi - (with M. Johnson and D. Thomas), Erdos-Ko-Rado theorems for a family of trees,
*Discrete Applied Mathematics***236**(2018), 464-471. pdf 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. pdf doi - (with M. Johnson and D. Paulusma), A reconfigurations analogue of Brooks' theorem and its consequences,
*Journal of Graph Theory***83**(2016), 340-358. pdf doi - (with M. Johnson and D. Paulusma), Kempe equivalence of colourings of cubic graphs,
*European Journal of Combinatorics***59**(2017), 1-10. pdf 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. pdf doi

- (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.