8 citations · 14 across the 5 of their papers we have counts for
1 paper · 2 filters
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…