6 citations · 10 across the 10 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
math.CO2016
Locally self-avoiding eulerian tours
Tien-Nam Le
It was independently conjectured by Häggkvist in 1989 and Kriesell in 2011 that given a positive integer , every simple eulerian graph with high minimum degree (depending on…
math.CO2016★ 1 cited
A Proof of the Barát-Thomassen Conjecture
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le +2
The Barát-Thomassen conjecture asserts that for every tree on edges, there exists a constant such that every -edge-connected graph with size divisible by can…