36 citations · 46 across the 3 of their papers we have counts for
4 papers
Hadwiger meets Cayley
Jacob W. Cooper, Adam Kabela, Daniel Král' +1
We show that every connected -chromatic graph contains at least spanning trees.
Scaling of quadratic and linear magnetooptic Kerr effect spectra with L2 ordering of CoMnSi Heusler compound
Robin Silber, Daniel Král, Ondřej Stejskal +6
The Heusler compound CoMnSi provides a crystallographic transition from B2 to L2 structure with increasing annealing temperature , being a model system for investigati…
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 …
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…