Leonardo Marciaga

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2026

Cones of Theta Graphs are Enumeratively Chromatic-Choosable

Kingston Barnes, Vincent Fesenmeier, Braxton Gaither +7

Chromatic choosability is a fundamental notion in list coloring. A graph $G$ is chromatic-choosable if its chromatic number $χ (G)$ equals its list chromatic number $χ_{ℓ} (G)$ . I…

math.CO2025

List Coloring the Cartesian Product of a Complete Graph and Complete Bipartite Graph

Hemanshu Kaul, Leonardo Marciaga, Jeffrey A. Mudrock

We study the list chromatic number of the Cartesian product of a complete graph of order $n$ and a complete bipartite graph with partite sets of size $a$ and $b$ , denoted $χ_{\ell}…