Carl Feghali
Carl Feghali
Computer Science Institute, Charles University, Prague
No verified email - 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
38*2016
Independent Feedback Vertex Set for -Free Graphs
M Bonamy, KK Dabrowski, C Feghali, M Johnson, D Paulusma
Algorithmica 81 (4), 1342-1369, 2019
252019
Kempe equivalence of colourings of cubic graphs
C Feghali, M Johnson, D Paulusma
European journal of combinatorics 59, 1-10, 2017
222017
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
162019
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
M Bonamy, KK Dabrowski, C Feghali, M Johnson, D Paulusma
arXiv preprint arXiv:1707.09817, 2017
12*2017
Paths between colourings of sparse graphs
C Feghali
European Journal of Combinatorics 75, 169-171, 2019
112019
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
72018
Erdős–Ko–Rado theorems for a family of trees
C Feghali, M Johnson, D Thomas
Discrete Applied Mathematics 236, 464-471, 2018
62018
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
62015
Toward Cereceda's conjecture for planar graphs
E Eiben, C Feghali
Journal of Graph Theory 94 (2), 267-277, 2020
52020
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
52020
Paths between colourings of graphs with bounded tree-width
C Feghali
Information Processing Letters 144, 37-38, 2019
52019
Reconfiguring 10-colourings of planar graphs
C Feghali
arXiv preprint arXiv:1902.02278, 2019
52019
Reconfiguration graph for vertex colourings of weakly chordal graphs
C Feghali, J Fiala
Discrete Mathematics 343 (3), 111733, 2020
32020
On the hilton-spencer intersection theorems for unions of cycles
P Borg, C Feghali
arXiv preprint arXiv:1908.08825, 2019
32019
An update on reconfiguring -colorings of planar graphs
Z Dvořák, C Feghali
arXiv preprint arXiv:2002.05383, 2020
12020
Partitioning a graph into degenerate subgraphs
FN Abu-Khzam, C Feghali, P Heggernes
European Journal of Combinatorics 83, 103015, 2020
12020
On cycle transversals and their connected variants in the absence of a small linear forest
C Feghali, M Johnson, G Paesani, D Paulusma
International Symposium on Fundamentals of Computation Theory, 258-273, 2019
12019
On cycle transversals and their connected variants in the absence of a small linear forest
C Feghali, M Johnson, G Paesani, D Paulusma
International Symposium on Fundamentals of Computation Theory, 258-273, 2019
12019
Reconfiguring colourings of graphs with bounded maximum average degree
C Feghali
arXiv preprint arXiv:1904.12698, 2019
12019
The system can't perform the operation now. Try again later.
Articles 1–20