EUVIMEDEUVIMED entdecken
Open Access · CC0

Binding number and degree conditions for path-factors in graphs

Ping Zhang

Filomat · 2025 · 39 (32) · 11589-11596

DOI: 10.2298/fil2532589z ↗

Kurz gefasst

Fachartikel in der Zeitschrift Filomat, 2025. Verfasst von Ping Zhang. Die Arbeit nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

For a graph G and an integer k \ge 2 , a P_{\ge k} -factor of G is a spanning subgraph of G with each component isomorphic to some path of order at least k. A graph G is P_{\ge k} -factor uniform if for any distinct edges e1 and e2, G admits a P_{\ge k} -factor including e_1 and excluding e_2 . For a non-negative integer n, G is ( (P_{\ge k}, n) )-critical uniform if for any V′ ⊆ V(G) with |V′| = n, G-V′ is P_{\ge k} -factor uniform. G is ( P_{\ge k} , n)-critical deleted if for any V′ ⊆ V(G) with |V′| = n and e ∈ E(G-V′), G-V′-e contains a P_{\ge k} -factor. In this note, we give some binding number and degree conditions for a graph to be ( (P_{\ge 2}, n) )-critical uniform and ( (P_{\ge 3}, n) )-critical deleted, which improve some known results.

Zitieren

APA

Zhang, P. (2025). Binding number and degree conditions for path-factors in graphs. Filomat, 39(32), 11589-11596. https://doi.org/10.2298/fil2532589z

Vancouver

Zhang P. Binding number and degree conditions for path-factors in graphs. Filomat. 2025;39(32):11589-11596. doi:10.2298/fil2532589z

BibTeX
@article{Zhang2025,
  author = {Zhang, Ping},
  title = {Binding number and degree conditions for path-factors in graphs},
  journal = {Filomat},
  year = {2025},
  volume = {39},
  number = {32},
  pages = {11589--11596},
  doi = {10.2298/fil2532589z}
}
Kostenlos starten →