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

43 papers

math.CO2026

Greedy Coloring and Simple Exponential Strengthenings of Brooks-Type Theorems

Alex Crane, Carl Feghali, Felicia Lucke +2

Brooks' Theorem is a foundational result in graph coloring: if a graph is connected, not a clique, and has maximum degree , then it admits a proper -coloring. In this p…

cs.DS2025

The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability

Carl Feghali, Hoang-Oanh Le, Van Bang Le

This paper continues the study of a new variant of graph coloring with a connectivity constraint recently introduced by Hsieh et al. [COCOON 2024]. A path in a vertex-colored graph…

math.CO2024

Beyond recognizing well-covered graphs

Carl Feghali, Malory Marin, Rémi Watrigant

We prove a number of results related to the computational complexity of recognizing well-covered graphs. Let and be positive integers and let be a graph. Then is sa…

math.CO2023

Three remarks on graphs

Carl Feghali, Malory Marin

Let . A graph is if for any pairwise disjoint independent vertex subsets in , there exist pairwise disjoint maximum indepe…

math.CO2023

Dirac's theorem on chordal graphs implies Brooks' theorem

Carl Feghali

We give yet another proof of the list-color version of Brooks' theorem that is due, independently, to Vizing and to Erdős, Rubin and Taylor, via a famous theorem of Dirac on chorda…

math.CO2023

Kempe Classes and Almost Bipartite Graphs

Daniel W. Cranston, Carl Feghali

Let be a graph and be a positive integer, and let denote the number of Kempe equivalence classes for the -colorings of . In 2006, Mohar noted that $Kc(G, k…