Edge-partitioning 3-edge-connected graphs into paths - Archive ouverte HAL
Article Dans Une Revue Journal of Combinatorial Theory, Series B Année : 2022

Dates et versions

hal-04531678 , version 1 (04-04-2024)

Identifiants

Citer

Tereza Klimošová, Stéphan Thomassé. Edge-partitioning 3-edge-connected graphs into paths. Journal of Combinatorial Theory, Series B, 2022, 156, pp.250-293. ⟨10.1016/j.jctb.2022.05.001⟩. ⟨hal-04531678⟩
17 Consultations
0 Téléchargements

Altmetric

Partager

More