A reconfigurations analogue of Brooks' Theorem and its consequences C Feghali, M Johnson, D Paulusma
Journal of graph theory 83 (4), 340-358, 2016
53 * 2016 On a conjecture of Mohar concerning Kempe equivalence of regular graphs M Bonamy, N Bousquet, C Feghali, M Johnson
Journal of Combinatorial Theory, Series B 135, 179-199, 2019
46 2019 Kempe equivalence of colourings of cubic graphs C Feghali, M Johnson, D Paulusma
European Journal of Combinatorics 59, 1-10, 2017
45 2017 Independent Feedback Vertex Set for M Bonamy, KK Dabrowski, C Feghali, M Johnson, D Paulusma
Algorithmica 81 (4), 1342-1369, 2019
41 2019 On cycle transversals and their connected variants in the absence of a small linear forest KK Dabrowski, C Feghali, M Johnson, G Paesani, D Paulusma, ...
Algorithmica, 1-26, 2020
22 2020 Independent feedback vertex sets for graphs of bounded diameter M Bonamy, KK Dabrowski, C Feghali, M Johnson, D Paulusma
Information Processing Letters 131, 26-32, 2018
22 2018 Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration M Bonamy, KK Dabrowski, C Feghali, M Johnson, D Paulusma
Journal of Graph Theory 98 (1), 81-109, 2021
20 * 2021 Reconfiguring colorings of graphs with bounded maximum average degree C Feghali
Journal of Combinatorial Theory, Series B 147, 133-138, 2021
19 2021 Paths between colourings of sparse graphs C Feghali
European Journal of Combinatorics 75, 169-171, 2019
19 2019 A Thomassen-type method for planar graph recoloring Z Dvořák, C Feghali
European Journal of Combinatorics 95, 103319, 2021
17 2021 Erdős–Ko–Rado theorems for a family of trees C Feghali, M Johnson, D Thomas
Discrete Applied Mathematics 236, 464-471, 2018
15 2018 An update on reconfiguring Z Dvořák, C Feghali
arXiv preprint arXiv:2002.05383, 2020
14 2020 Reconfiguration graph for vertex colourings of weakly chordal graphs C Feghali, J Fiala
Discrete Mathematics 343 (3), 111733, 2020
13 2020 Recoloring planar graphs of girth at least five V Bartier, N Bousquet, C Feghali, M Heinrich, B Moore, T Pierron
SIAM Journal on Discrete Mathematics 37 (1), 332-350, 2023
12 2023 Matching cuts in graphs of high girth and H-free graphs C Feghali, F Lucke, D Paulusma, B Ries
arXiv preprint arXiv:2212.12317, 2022
12 * 2022 Toward Cereceda's conjecture for planar graphs E Eiben, C Feghali
Journal of Graph Theory 94 (2), 267-277, 2020
11 2020 The maximum sum of sizes of cross-intersecting families of subsets of a set P Borg, C Feghali
Discrete Mathematics 345 (11), 112981, 2022
10 2022 A note on matching-cut in Pt-free graphs C Feghali
Information Processing Letters, 106294, 2022
10 2022 Partitioning a graph into degenerate subgraphs FN Abu-Khzam, C Feghali, P Heggernes
European Journal of Combinatorics 83, 103015, 2020
10 2020 Kempe equivalence of C Feghali
arXiv preprint arXiv:2101.04065, 2021
8 2021 
Matthew JohnsonProfessor in Computer Science, Durham UniversityEmail được xác minh tại dur.ac.uk