Edge-Partitioning a Graph into Paths: Beyond the Barát-Thomassen Conjecture
Crossref DOI link: https://doi.org/10.1007/s00493-017-3661-5
Published Online: 2018-05-17
Published Print: 2019-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Bensmail, Julien
Harutyunyan, Ararat
Le, Tien-Nam
Thomassé, Stéphan
Text and Data Mining valid from 2018-05-17
Article History
Received: 30 June 2016
Revised: 12 September 2017
First Online: 17 May 2018