3 citations · 8 across the 6 of their papers we have counts for
Showing 2017 · cs.DMShow all
2 papers · 2 filters
cs.DM2017
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs
François Dross, Mickael Montassier, Alexandre Pinlou
We prove that every triangle-free planar graph of order and size has an induced linear forest with at least vertices, and thus at least $\frac{5n + 8}{…
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…