Computational complexity of covering disconnected multigraphs - Archive ouverte HAL
Article Dans Une Revue Discrete Applied Mathematics Année : 2024

Dates et versions

hal-04738106 , version 1 (15-10-2024)

Identifiants

Citer

Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl, Michaela Seifrtová. Computational complexity of covering disconnected multigraphs. Discrete Applied Mathematics, 2024, 359, pp.229-243. ⟨10.1016/j.dam.2024.07.035⟩. ⟨hal-04738106⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More