Crossref
Enumeration of spanning trees containing a perfect matching in saturated non-covered graphs
Discrete Applied Mathematics · 2026-08 · 389 · 126-134
DOI: 10.1016/j.dam.2026.03.054 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-08. Verfasst von Yan Tang und 2 weiteren Autor:innen. Die Arbeit nennt 33 Literaturangaben. Gefördert von: China Scholarship Council, Fujian Provincial Natural Science Foundation.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- China Scholarship Council
- Fujian Provincial Natural Science Foundation
Zitieren
APA
Tang, Y., Dong, F., & Tian, T. (2026). Enumeration of spanning trees containing a perfect matching in saturated non-covered graphs. Discrete Applied Mathematics, 389, 126-134. https://doi.org/10.1016/j.dam.2026.03.054
Vancouver
Tang Y, Dong F, Tian T. Enumeration of spanning trees containing a perfect matching in saturated non-covered graphs. Discrete Applied Mathematics. 2026;389:126-134. doi:10.1016/j.dam.2026.03.054
BibTeX
@article{Tang2026,
author = {Tang, Yan and Dong, Fengming and Tian, Tao},
title = {Enumeration of spanning trees containing a perfect matching in saturated non-covered graphs},
journal = {Discrete Applied Mathematics},
year = {2026},
volume = {389},
pages = {126--134},
doi = {10.1016/j.dam.2026.03.054}
}
EUVIMED