EUVIMEDEUVIMED entdecken
Crossref

Connectivity keeping trees in 3-connected or 3-edge-connected graphs

Haiyang Liu, Qinghai Liu, Yanmei Hong

Discrete Mathematics · 2023-12 · 346 (12) · 113679

DOI: 10.1016/j.disc.2023.113679 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Mathematics, 2023-12. Verfasst von Haiyang Liu und 2 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 10 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Liu, H., Liu, Q., & Hong, Y. (2023). Connectivity keeping trees in 3-connected or 3-edge-connected graphs. Discrete Mathematics, 346(12), 113679. https://doi.org/10.1016/j.disc.2023.113679

Vancouver

Liu H, Liu Q, Hong Y. Connectivity keeping trees in 3-connected or 3-edge-connected graphs. Discrete Mathematics. 2023;346(12):113679. doi:10.1016/j.disc.2023.113679

BibTeX
@article{Liu2023,
  author = {Liu, Haiyang and Liu, Qinghai and Hong, Yanmei},
  title = {Connectivity keeping trees in 3-connected or 3-edge-connected graphs},
  journal = {Discrete Mathematics},
  year = {2023},
  volume = {346},
  number = {12},
  pages = {113679},
  doi = {10.1016/j.disc.2023.113679}
}
Kostenlos starten →