EUVIMEDEUVIMED entdecken
Crossref

Highly connected triples and Mader's conjecture

Qinghai Liu, Kai Ying, Yanmei Hong

Journal of Graph Theory · 2024-11 · 107 (3) · 478-484

DOI: 10.1002/jgt.23144 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Graph Theory, online erschienen am 17.06.2024. Verfasst von Qinghai Liu und 2 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 13 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Natural Science Foundation of Fujian Province.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Mader proved that, for any tree of order , every ‐connected graph with contains a subtree such that is ‐connected. We proved that any graph with minimum degree contains ‐connected triples. As a corollary, we prove that, for any tree of order , every ‐connected graph with contains a subtree such that is still ‐connected, improving Mader's condition to a linear bound.

Förderung

  • National Natural Science Foundation of China
  • Natural Science Foundation of Fujian Province

Zitieren

APA

Liu, Q., Ying, K., & Hong, Y. (2024). Highly connected triples and Mader's conjecture. Journal of Graph Theory, 107(3), 478-484. https://doi.org/10.1002/jgt.23144

Vancouver

Liu Q, Ying K, Hong Y. Highly connected triples and Mader's conjecture. Journal of Graph Theory. 2024;107(3):478-484. doi:10.1002/jgt.23144

BibTeX
@article{Liu2024,
  author = {Liu, Qinghai and Ying, Kai and Hong, Yanmei},
  title = {Highly connected triples and Mader's conjecture},
  journal = {Journal of Graph Theory},
  year = {2024},
  volume = {107},
  number = {3},
  pages = {478--484},
  doi = {10.1002/jgt.23144}
}
Kostenlos starten →