Crossref
A minimum degree condition for a 2-connected graph containing all possible orders of 2-connected subgraphs
Discrete Applied Mathematics · 2026-07 · 387 · 129-136
DOI: 10.1016/j.dam.2026.03.003 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-07. Verfasst von Qianlong Yin und 1 weiteren Autor:innen. Die Arbeit nennt 13 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Yin, Q., & Wu, B. (2026). A minimum degree condition for a 2-connected graph containing all possible orders of 2-connected subgraphs. Discrete Applied Mathematics, 387, 129-136. https://doi.org/10.1016/j.dam.2026.03.003
Vancouver
Yin Q, Wu B. A minimum degree condition for a 2-connected graph containing all possible orders of 2-connected subgraphs. Discrete Applied Mathematics. 2026;387:129-136. doi:10.1016/j.dam.2026.03.003
BibTeX
@article{Yin2026,
author = {Yin, Qianlong and Wu, Baoyindureng},
title = {A minimum degree condition for a 2-connected graph containing all possible orders of 2-connected subgraphs},
journal = {Discrete Applied Mathematics},
year = {2026},
volume = {387},
pages = {129--136},
doi = {10.1016/j.dam.2026.03.003}
}
EUVIMED