3 citations · 3 across the 1 of their papers we have counts for
2 papers
cs.DM2013★ 3 cited
Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable
Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
For graphs of bounded maximum average degree, we consider the problem of 2-distance coloring. This is the problem of coloring the vertices while ensuring that two vertices that are…
cs.DM2013
Application of entropy compression in pattern avoidance
Pascal Ochem, Alexandre Pinlou
In combinatorics on words, a word over an alphabet is said to avoid a pattern over an alphabet if there is no factor of such that where $h: Δ^*\toΣ…