22 citations · 92 across the 73 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.CO2020
Coloring -free graphs with colors
Daniel W. Cranston, Hudson Lafayette, Landon Rabern
The Borodin-Kostochka Conjecture states that for a graph , if and , then . We prove the Borodin-Kostochka Conjecture for $(P_5,…
math.CO2020
Vertex Partitions into an Independent Set and a Forest with Each Component Small
Daniel W. Cranston, Matthew P. Yancey
For each integer k >= 2, we determine a sharp bound on mad(G) such that V(G) can be partitioned into sets I and F_k, where I is an independent set and G[F_k] is a forest in which e…