Two Completely Independent Spanning Trees of $$P_4$$-Free Graphs
Graphs and Combinatorics · 2023-04 · 39 (2)
DOI: 10.1007/s00373-023-02622-2 ↗Kurz gefasst
Fachartikel in der Zeitschrift Graphs and Combinatorics, online erschienen am 12.03.2023. Verfasst von Xiaodong Chen und 2 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 9 Literaturangaben. Gefördert von: Research Fund of the Doctoral Program of Liaoning Normal University, National Natural Science Foundation of China.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Research Fund of the Doctoral Program of Liaoning Normal University
- National Natural Science Foundation of China
Zitieren
APA
Chen, X., Li, J., & Lu, F. (2023). Two Completely Independent Spanning Trees of $$P_4$$-Free Graphs. Graphs and Combinatorics, 39(2). https://doi.org/10.1007/s00373-023-02622-2
Vancouver
Chen X, Li J, Lu F. Two Completely Independent Spanning Trees of $$P_4$$-Free Graphs. Graphs and Combinatorics. 2023;39(2). doi:10.1007/s00373-023-02622-2
BibTeX
@article{Chen2023,
author = {Chen, Xiaodong and Li, Jingjing and Lu, Fuliang},
title = {Two Completely Independent Spanning Trees of $$P_4$$-Free Graphs},
journal = {Graphs and Combinatorics},
year = {2023},
volume = {39},
number = {2},
doi = {10.1007/s00373-023-02622-2}
}
EUVIMED