Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract) - Archive ouverte HAL
Communication Dans Un Congrès Année : 2023
Fichier non déposé

Dates et versions

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

Identifiants

Citer

Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl, Michaela Seifrtová. Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract). The 49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023, Jun 2023, Fribourg (Suisse), Switzerland. pp.101-115, ⟨10.1007/978-3-031-43380-1_8⟩. ⟨hal-04738136⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More