Crossref
Covering complete geometric graphs by monotone paths
Combinatorics and Number Theory · 17.04.2026 · 15 (1) · 73-82
DOI: 10.2140/cnt.2026.15.73 ↗Kurz gefasst
Fachartikel in der Zeitschrift Combinatorics and Number Theory, online erschienen am 17.04.2026. Verfasst von Adrian Dumitrescu und 3 weiteren Autor:innen. Die Arbeit nennt 18 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Dumitrescu, A., Pach, J., Saghafian, M., & Scott, A. (2026). Covering complete geometric graphs by monotone paths. Combinatorics and Number Theory, 15(1), 73-82. https://doi.org/10.2140/cnt.2026.15.73
Vancouver
Dumitrescu A, Pach J, Saghafian M, Scott A. Covering complete geometric graphs by monotone paths. Combinatorics and Number Theory. 2026;15(1):73-82. doi:10.2140/cnt.2026.15.73
BibTeX
@article{Dumitrescu2026,
author = {Dumitrescu, Adrian and Pach, János and Saghafian, Morteza and Scott, Alex},
title = {Covering complete geometric graphs by monotone paths},
journal = {Combinatorics and Number Theory},
year = {2026},
volume = {15},
number = {1},
pages = {73--82},
doi = {10.2140/cnt.2026.15.73}
}
EUVIMED