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 2020Show all

4 papers · 1 filter

math.CO2020★ 2 cited

Decomposing a triangle-free planar graph into a forest and a subcubic forest

Carl Feghali, Robert Šámal

We strengthen a result of Dross, Montassier and Pinlou (2017) that the vertex set of every triangle-free planar graph can be decomposed into a set that induces a forest and a set t…

math.CO2020

A simple proof of Talbot's theorem for intersecting separated sets

Peter Borg, Carl Feghali

A subset $A$ of $[n] = {1, \dots, n}$ is $k$ -separated if, when the elements of $[n]$ are considered on a circle, between any two elements of $A$ there are at least $k$ elements…

math.CO2020

A Thomassen-type method for planar graph recoloring

Zdeněk Dvořák, Carl Feghali

The reconfiguration graph $R_{k} (G)$ for the $k$ -colorings of a graph $G$ has as vertices all possible $k$ -colorings of $G$ and two colorings are adjacent if they differ in the color…

math.CO2020

An update on reconfiguring $10$ -colorings of planar graphs

Zdeněk Dvořák, Carl Feghali

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

Decomposing a triangle-free planar graph into a forest and a subcubic forest

A simple proof of Talbot's theorem for intersecting separated sets

A Thomassen-type method for planar graph recoloring

An update on reconfiguring 10-colorings of planar graphs

An update on reconfiguring $10$ -colorings of planar graphs