1 citations · 2 across the 4 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2023
Slow Coloring of 3k-Connected Graphs
Joan Morris, Gregory Puleo
The slow coloring game was introduced by Mahoney, Puleo, and West and it is played by two players, Lister and Painter, on a graph \(G\). In round \(i\), Lister marks a nonempty sub…
math.CO2014★ 1 cited
Extremal Aspects of the Erdős--Gallai--Tuza Conjecture
Gregory J. Puleo
Erdős, Gallai, and Tuza posed the following problem: given an -vertex graph , let denote the smallest size of a set of edges whose deletion makes triangle-free,…
math.CO2014
Choosability with Separation in Complete Multipartite Graphs
Gregory J. Puleo
We show that there is a constant such that when and , the complete -partite graph has a non-colorable list assignment such that $|L(v)|…