55 citations · 324 across the 27 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2020★ 11 cited
Between proper and strong edge-colorings of subcubic graphs
Hervé Hocquard, Dimitri Lajou, Borut Lu{ž}ar
In a proper edge-coloring the edges of every color form a matching. A matching is induced if the end-vertices of its edges induce a matching. A strong edge-coloring is an edge-colo…
cs.DM2017
On repetition thresholds of caterpillars and trees of bounded degree
Borut Lužar, Pascal Ochem, Alexandre Pinlou
The repetition threshold is the smallest real number such that there exists an infinite word over a -letter alphabet that avoids repetition of exponent strictly greater than…