Carl Feghali

activity

20162025

most citedMatching Cuts in Graphs of High Girth and H-Free Graphs

2 citations · 2 across the 14 of their papers we have counts for

collaborators

Showing 2018Show all

5 papers · 1 filter

math.CO2018

The Erdős-Ko-Rado property of trees of depth two

Carl Feghali

A family of sets is intersecting if any two sets in the family intersect. Given a graph $G$ and an integer $r \geq 1$ , let $I^{(r)} (G)$ denote the family of independent se…

math.CO2018

Enclosings of Decompositions of Complete Multigraphs in $2$ -Edge-Connected $r$ -Factorizations

John Asplund, Pierre Charbit, Carl Feghali

A decomposition of a multigraph $G$ is a partition of its edges into subgraphs $G (1), \dots, G (k)$ . It is called an $r$ -factorization if every $G (i)$ is $r$ -regular and spanning.…

cs.DM2018

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…

math.CO2018

Paths between colourings of sparse graphs

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…

The Erdős-Ko-Rado property of trees of depth two

Enclosings of Decompositions of Complete Multigraphs in 2-Edge-Connected r-Factorizations

Towards Cereceda's conjecture for planar graphs

Partitioning a graph into degenerate subgraphs

Paths between colourings of sparse graphs

Enclosings of Decompositions of Complete Multigraphs in $2$ -Edge-Connected $r$ -Factorizations