EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Saturation numbers for linear forests P 5 ∪ P 4 ∪ tP 2

Renying Chang, Xueliang Li

RAIRO - Operations Research · 2026-07 · 60 (4) · 2121-2129

DOI: 10.1051/ro/2026073 ↗

Kurz gefasst

Fachartikel in der Zeitschrift RAIRO - Operations Research, online erschienen am 16.07.2026. Verfasst von Renying Chang und 1 weiteren Autor:innen. Die Arbeit nennt 17 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We say that G is F -saturated if G contains no copy of F and for all e ∈ E ( Ḡ ) the graph G + e does contain a copy of F . The saturation number, denote by sat( n , F ) is the minimum size of a graph with order n in all F -saturated graphs. In this paper, we determine the saturation numbers for linear forests P 5 ∪ P 4 ∪ tP 2 and characterize the extremal graphs.

Zitieren

APA

Chang, R., & Li, X. (2026). Saturation numbers for linear forests P 5 ∪ P 4 ∪ tP 2. RAIRO - Operations Research, 60(4), 2121-2129. https://doi.org/10.1051/ro/2026073

Vancouver

Chang R, Li X. Saturation numbers for linear forests P 5 ∪ P 4 ∪ tP 2. RAIRO - Operations Research. 2026;60(4):2121-2129. doi:10.1051/ro/2026073

BibTeX
@article{Chang2026,
  author = {Chang, Renying and Li, Xueliang},
  title = {Saturation numbers for linear forests P 5 ∪ P 4 ∪ tP 2},
  journal = {RAIRO - Operations Research},
  year = {2026},
  volume = {60},
  number = {4},
  pages = {2121--2129},
  doi = {10.1051/ro/2026073}
}
Kostenlos starten →