Open Access · CC BY 4.0
The complexity of color-constrained paths in semicomplete multipartite digraphs
Discrete Applied Mathematics · 2026-11 · 393 · 174-187
DOI: 10.1016/j.dam.2026.06.030 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-11. Verfasst von Julian Christoph Brinkmann. Die Arbeit nennt 15 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Brinkmann, J. C. (2026). The complexity of color-constrained paths in semicomplete multipartite digraphs. Discrete Applied Mathematics, 393, 174-187. https://doi.org/10.1016/j.dam.2026.06.030
Vancouver
Brinkmann JC. The complexity of color-constrained paths in semicomplete multipartite digraphs. Discrete Applied Mathematics. 2026;393:174-187. doi:10.1016/j.dam.2026.06.030
BibTeX
@article{Brinkmann2026,
author = {Brinkmann, Julian Christoph},
title = {The complexity of color-constrained paths in semicomplete multipartite digraphs},
journal = {Discrete Applied Mathematics},
year = {2026},
volume = {393},
pages = {174--187},
doi = {10.1016/j.dam.2026.06.030}
}
EUVIMED