Decomposing a triangle-free planar graph into a forest and a subcubic forest - Archive ouverte HAL
Article Dans Une Revue European Journal of Combinatorics Année : 2024

Decomposing a triangle-free planar graph into a forest and a subcubic forest

Dates et versions

hal-04632868 , version 1 (02-07-2024)

Identifiants

Citer

Carl Feghali, Robert Šámal. Decomposing a triangle-free planar graph into a forest and a subcubic forest. European Journal of Combinatorics, 2024, 116, pp.103878. ⟨10.1016/j.ejc.2023.103878⟩. ⟨hal-04632868⟩
13 Consultations
0 Téléchargements

Altmetric

Partager

More