Follow
Carl Feghali
Carl Feghali
ENS Lyon, CNRS, LIP
Verified email at ens-lyon.fr - Homepage
Title
Cited by
Cited by
Year
A reconfigurations analogue of Brooks' Theorem and its consequences
C Feghali, M Johnson, D Paulusma
Journal of Graph Theory 83 (4), 340-358, 2016
46*2016
Kempe equivalence of colourings of cubic graphs
C Feghali, M Johnson, D Paulusma
European journal of combinatorics 59, 1-10, 2017
392017
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
352019
Independent Feedback Vertex Set for P 5 -Free Graphs
M Bonamy, KK Dabrowski, C Feghali, M Johnson, D Paulusma
Algorithmica 81 (4), 1342-1369, 2019
332019
Paths between colourings of sparse graphs
C Feghali
European Journal of Combinatorics 75, 169-171, 2019
162019
Erdős–Ko–Rado theorems for a family of trees
C Feghali, M Johnson, D Thomas
Discrete Applied Mathematics 236, 464-471, 2018
142018
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
13*2021
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
132020
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
132018
Reconfiguring colorings of graphs with bounded maximum average degree
C Feghali
Journal of Combinatorial Theory, Series B 147, 133-138, 2021
122021
Toward Cereceda's conjecture for planar graphs
E Eiben, C Feghali
Journal of Graph Theory 94 (2), 267-277, 2020
92020
Reconfiguration graph for vertex colourings of weakly chordal graphs
C Feghali, J Fiala
Discrete Mathematics 343 (3), 111733, 2020
92020
A Thomassen-type method for planar graph recoloring
Z Dvořák, C Feghali
European Journal of Combinatorics 95, 103319, 2021
82021
Reconfiguring 10-colourings of planar graphs
C Feghali
Graphs and Combinatorics 36 (6), 1815-1818, 2020
72020
Paths between colourings of graphs with bounded tree-width
C Feghali
Information Processing Letters 144, 37-38, 2019
72019
An update on reconfiguring -colorings of planar graphs
Z Dvořák, C Feghali
arXiv preprint arXiv:2002.05383, 2020
62020
Partitioning a graph into disjoint cliques and a triangle-free graph
FN Abu-Khzam, C Feghali, H Müller
Discrete Applied Mathematics 190, 1-12, 2015
6*2015
Partitioning a graph into degenerate subgraphs
FN Abu-Khzam, C Feghali, P Heggernes
European Journal of Combinatorics 83, 103015, 2020
52020
Recolouring planar graphs of girth at least five
V Bartier, N Bousquet, C Feghali, M Heinrich, B Moore, T Pierron
arXiv preprint arXiv:2112.00631, 2021
42021
The Hilton-Spencer Cycle Theorems Via Katona’s Shadow Intersection Theorem
P Borg, C Feghali
Discussiones Mathematicae Graph Theory, 2020
4*2020
The system can't perform the operation now. Try again later.
Articles 1–20