42 citations · 162 across the 15 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018
On non-repetitive sequences of arithmetic progressions:the cases
Borut Lužar, Martina Mockovčiaková, Pascal Ochem +2
A -subsequence of a sequence is a subsequence , for any positive integer and any , . A \textit{-Thue seque…
math.CO2018★ 2 cited
Note on 3-Choosability of Planar Graphs with Maximum Degree 4
François Dross, Borut Lužar, Mária Maceková +1
Deciding whether a planar graph (even of maximum degree ) is -colorable is NP-complete. Determining subclasses of planar graphs being -colorable has a long history, but si…