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.CCShow all

3 papers · 1 filter

cs.CC2022

1-Extendability of independent sets

Pierre Bergé, Anthony Busson, Carl Feghali +1

In the 70s, Berge introduced 1-extendable graphs (also called B-graphs), which are graphs where every vertex belongs to a maximum independent set. Motivated by an application in th…

cs.CC2015

A Reconfigurations Analogue of Brooks' Theorem and its Consequences

Carl Feghali, Matthew Johnson, Daniël Paulusma

Let $G$ be a simple undirected graph on $n$ vertices with maximum degree~ $Δ$ . Brooks' Theorem states that $G$ has a $Δ$ -colouring unless~ $G$ is a complete graph, or a cycle with an…

cs.CC2014

Partitioning a Graph into Disjoint Cliques and a Triangle-free Graph

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

A graph $G = (V, E)$ is \emph{partitionable} if there exists a partition ${A, B}$ of $V$ such that $A$ induces a disjoint union of cliques and $B$ induces a triangle-free graph.…