EUVIMEDEUVIMED entdecken
Crossref

The parameterized complexity of the properly colored spanning tree problem

Yuhang Bai, Shenggui Zhang, Yandong Bai, Jianhua Tu

Discrete Applied Mathematics · 2026-10 · 392 · 89-101

DOI: 10.1016/j.dam.2026.05.026 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-10. Verfasst von Yuhang Bai und 3 weiteren Autor:innen. Die Arbeit nennt 31 Literaturangaben. Gefördert von: Ministry of Science and Technology of the People's Republic of China, National Natural Science Foundation of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Ministry of Science and Technology of the People's Republic of China
  • National Natural Science Foundation of China

Zitieren

APA

Bai, Y., Zhang, S., Bai, Y., & Tu, J. (2026). The parameterized complexity of the properly colored spanning tree problem. Discrete Applied Mathematics, 392, 89-101. https://doi.org/10.1016/j.dam.2026.05.026

Vancouver

Bai Y, Zhang S, Bai Y, Tu J. The parameterized complexity of the properly colored spanning tree problem. Discrete Applied Mathematics. 2026;392:89-101. doi:10.1016/j.dam.2026.05.026

BibTeX
@article{Bai2026,
  author = {Bai, Yuhang and Zhang, Shenggui and Bai, Yandong and Tu, Jianhua},
  title = {The parameterized complexity of the properly colored spanning tree problem},
  journal = {Discrete Applied Mathematics},
  year = {2026},
  volume = {392},
  pages = {89--101},
  doi = {10.1016/j.dam.2026.05.026}
}
Kostenlos starten →