Skip to main content
5 events
when toggle format what by license comment
May 13, 2021 at 10:40 vote accept Xin Zhang
May 13, 2021 at 2:58 comment added Gordon Royle Also known as an L(1,1) labelling….
May 13, 2021 at 0:56 answer added Tony Huynh timeline score: 5
May 13, 2021 at 0:43 comment added Sam Hopkins Well from your original graph $G$ it's easy to make a new graph $G'$ with the same vertex set which has $u$ and $v$ adjacent iff they are at distance $<= 2$ from each other, and then you're just looking at usual colorings of $G'$, right?
May 13, 2021 at 0:37 history asked Xin Zhang CC BY-SA 4.0