8 citations · 9 across the 3 of their papers we have counts for
1 paper · 1 filter
Nicholas Kosar, Sarka Petrickova, Benjamin Reiniger +1
Recently, Kim and Park have found an infinite family of graphs whose squares are not chromatic-choosable. Xuding Zhu asked whether there is some k such that all kth power graph…