36 citations · 46 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2020
Hadwiger meets Cayley
Jacob W. Cooper, Adam Kabela, Daniel Král' +1
We show that every connected -chromatic graph contains at least spanning trees.
math.CO2017
Walk entropy and walk-regularity
Kyle Kloster, Daniel Král', Blair D. Sullivan
A graph is said to be walk-regular if, for each , every vertex is contained in the same number of closed walks of length . We construct a -vertex graph …
math.CO2009★ 36 cited
Algebraic proof of Brooks' theorem
Jan Hladký, Daniel Král', Uwe Schauz
We give a proof of Brooks' theorem and its list coloring extension using the algebraic method of Alon and Tarsi; this also shows that the Brooks' theorem remains valid in a more ge…