Properly colored spanning trees via subdivision of a given tree in monochromatic triangle-free edge-colored complete graphs
Discrete Mathematics · 2026-09 · 349 (9) · 115131
DOI: 10.1016/j.disc.2026.115131 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics, 2026-09. Verfasst von Ruonan Li und 3 weiteren Autor:innen. Die Arbeit nennt 37 Literaturangaben. Gefördert von: China Scholarship Council, Institute for Basic Science, National Natural Science Foundation of China.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- China Scholarship Council
- Institute for Basic Science
- National Natural Science Foundation of China
Zitieren
APA
Li, R., Lu, R., Su, X., & Zhang, S. (2026). Properly colored spanning trees via subdivision of a given tree in monochromatic triangle-free edge-colored complete graphs. Discrete Mathematics, 349(9), 115131. https://doi.org/10.1016/j.disc.2026.115131
Vancouver
Li R, Lu R, Su X, Zhang S. Properly colored spanning trees via subdivision of a given tree in monochromatic triangle-free edge-colored complete graphs. Discrete Mathematics. 2026;349(9):115131. doi:10.1016/j.disc.2026.115131
BibTeX
@article{Li2026,
author = {Li, Ruonan and Lu, Ruhui and Su, Xueli and Zhang, Shenggui},
title = {Properly colored spanning trees via subdivision of a given tree in monochromatic triangle-free edge-colored complete graphs},
journal = {Discrete Mathematics},
year = {2026},
volume = {349},
number = {9},
pages = {115131},
doi = {10.1016/j.disc.2026.115131}
}
EUVIMED