Carl Feghali

activity

20142026

most citedOn the Hilton-Spencer intersection theorems for unions of cycles

5 citations · 17 across the 27 of their papers we have counts for

collaborators

Showing cs.DMShow all

5 papers · 1 filter

cs.DM2018★ 4 cited

Towards Cereceda's conjecture for planar graphs

Eduard Eiben, Carl Feghali

The reconfiguration graph $R_{k} (G)$ of the $k$ -colourings of a graph $G$ has as vertex set the set of all possible $k$ -colourings of $G$ and two colourings are adjacent if they diff…

cs.DM2018

Partitioning a graph into degenerate subgraphs

Faisal N. Abu-Khzam, Carl Feghali, Pinar Heggernes

Let $G = (V, E)$ be a connected graph with maximum degree $k \geq 3$ distinct from $K_{k + 1}$ . Given integers $s \geq 2$ and $p_{1}, \dots, p_{s} \geq 0$ , $G$ is said to be $(p_1, \dots, p…

cs.DM2015

On a conjecture of Mohar concerning Kempe equivalence of regular graphs

Marthe Bonamy, Nicolas Bousquet, Carl Feghali +1

Let $G$ be a graph with a vertex colouring $α$ . Let $a$ and $b$ be two colours. Then a connected component of the subgraph induced by those vertices coloured either $a$ or $b$ is k…

cs.DM2015

Kempe Equivalence of Colourings of Cubic Graphs

Carl Feghali, Matthew Johnson, Daniel Paulusma

Given a graph $G = (V, E)$ and a proper vertex colouring of $G$ , a Kempe chain is a subset of $V$ that induces a maximal connected subgraph of $G$ in which every vertex has one of two…

cs.DM2014★ 4 cited

NP-hardness results for partitioning graphs into disjoint cliques and a triangle-free subgraph

Carl Feghali, Faisal N. Abu-Khzam, Haiko Müller

This paper investigates the computational complexity of deciding whether the vertices of a graph can be partitioned into a disjoint union of cliques and a triangle-free subgraph. T…