Sparse graphs with bounded induced cycle packing number have logarithmic treewidth - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Combinatorial Theory, Series B Année : 2024

Dates et versions

hal-04522701 , version 1 (27-03-2024)

Identifiants

Citer

Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, et al.. Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. Journal of Combinatorial Theory, Series B, 2024, 167, pp.215-249. ⟨10.1016/j.jctb.2024.03.003⟩. ⟨hal-04522701⟩
3 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More