3 citations · 3 across the 2 of their papers we have counts for
2 papers
math.CO2021
Structure in sparse -critical graphs
Ron Gould, Victor Larsen, Luke Postle
Recently, Kostochka and Yancey proved that a conjecture of Ore is asymptotically true by showing that every -critical graph satisfies $|E(G)|\geq\left\lceil\left(\frac{k}{2}-\fr…
math.CO2017★ 3 cited
Forbidden Subgraphs for Chorded Pancyclicity
Megan Cream, Ronald J. Gould, Victor Larsen
We call a graph pancyclic if it contains at least one cycle of every possible length , for . In this paper, we define a new property called chorded pancycl…