On Minimally 1-tough $$(P_2\cup 3P_1)$$-Free Graphs
Bulletin of the Malaysian Mathematical Sciences Society · 2026-04 · 49 (2)
DOI: 10.1007/s40840-026-02091-9 ↗Kurz gefasst
Fachartikel in der Zeitschrift Bulletin of the Malaysian Mathematical Sciences Society, online erschienen am 07.04.2026. Verfasst von Shiyu Cao und 1 weiteren Autor:innen. Die Arbeit nennt 24 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Taishan Scholar Project of Shandong Province.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
- Taishan Scholar Project of Shandong Province
Zitieren
APA
Cao, S., & Chen, J. (2026). On Minimally 1-tough $$(P_2\cup 3P_1)$$-Free Graphs. Bulletin of the Malaysian Mathematical Sciences Society, 49(2). https://doi.org/10.1007/s40840-026-02091-9
Vancouver
Cao S, Chen J. On Minimally 1-tough $$(P_2\cup 3P_1)$$-Free Graphs. Bulletin of the Malaysian Mathematical Sciences Society. 2026;49(2). doi:10.1007/s40840-026-02091-9
BibTeX
@article{Cao2026,
author = {Cao, Shiyu and Chen, Jing},
title = {On Minimally 1-tough $$(P_2\cup 3P_1)$$-Free Graphs},
journal = {Bulletin of the Malaysian Mathematical Sciences Society},
year = {2026},
volume = {49},
number = {2},
doi = {10.1007/s40840-026-02091-9}
}
EUVIMED