Crossref
On sufficient degree conditions for a graph to be disjoint path coverable
Discrete Applied Mathematics · 2026-09 · 390 · 72-81
DOI: 10.1016/j.dam.2026.04.009 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-09. Verfasst von Shujie Chen und 1 weiteren Autor:innen. Die Arbeit nennt 29 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Fujian Provincial Natural Science Foundation.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
- Fujian Provincial Natural Science Foundation
Zitieren
APA
Chen, S., & Tian, T. (2026). On sufficient degree conditions for a graph to be disjoint path coverable. Discrete Applied Mathematics, 390, 72-81. https://doi.org/10.1016/j.dam.2026.04.009
Vancouver
Chen S, Tian T. On sufficient degree conditions for a graph to be disjoint path coverable. Discrete Applied Mathematics. 2026;390:72-81. doi:10.1016/j.dam.2026.04.009
BibTeX
@article{Chen2026,
author = {Chen, Shujie and Tian, Tao},
title = {On sufficient degree conditions for a graph to be disjoint path coverable},
journal = {Discrete Applied Mathematics},
year = {2026},
volume = {390},
pages = {72--81},
doi = {10.1016/j.dam.2026.04.009}
}
EUVIMED