Felicia Lucke

activity

20222026

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

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

collaborators

Showing 2026Show all

3 papers · 1 filter

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 $Δ \geq 3$ , then it admits a proper $Δ$ -coloring. In this p…

math.CO2026

Optimal b-Colourings and Fall Colourings in $H$ -Free Graphs

Jungho Ahn, Tala Eagling-Vose, Felicia Lucke +3

In a colouring of a graph, a vertex is b-chromatic if it is adjacent to a vertex of every other colour. We consider four well-studied colouring problems: b-Chromatic Number, Tight…

math.CO2026

Steiner Forest for $H$ -Subgraph-Free Graphs

Tala Eagling-Vose, David C. Kutner, Felicia Lucke +4

Our main result is a full classification, for every connected graph $H$ , of the computational complexity of Steiner Forest on $H$ -subgraph-free graphs. To obtain this dichotomy, we…

Greedy Coloring and Simple Exponential Strengthenings of Brooks-Type Theorems

Optimal b-Colourings and Fall Colourings in H-Free Graphs

Steiner Forest for H-Subgraph-Free Graphs

Optimal b-Colourings and Fall Colourings in $H$ -Free Graphs

Steiner Forest for $H$ -Subgraph-Free Graphs