Tight binding number bound for P≥3-factor uniform graphs-Reference-Cited by-同舟云学术

Tight binding number bound for P≥3-factor uniform graphs

Published:2021-12 Issue: Volume:172 Page:106162
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Gao Wei,Wang Weifan

Funder

National Natural Science Foundation of China

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference13 articles.

1. Graph Theory;Bondy,2008

2. Tight bounds for the existence of path factors in network vulnerability parameter settings;Gao;Int. J. Intell. Syst.,2021

3. Network vulnerability parameter and results on two surfaces;Gao;Int. J. Intell. Syst.,2021

4. A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two;Kaneko;J. Comb. Theory, Ser. B,2003

5. Research on fractional critical covered graphs;Wang;Probl. Inf. Transm.,2020

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Independence number and minimum degree for path-factor critical uniform graphs;Discrete Applied Mathematics;2024-12

2. Characterizing spanning trees via the size or the spectral radius of graphs;Aequationes mathematicae;2024-09-04

3. On perfect 2-matching uniform graphs;Proceedings of the Romanian Academy, Series A: Mathematics, Physics, Technical Sciences, Information Science;2024-06-30

4. Sufficient conditions for fractional [a, b]-deleted graphs;Indian Journal of Pure and Applied Mathematics;2024-03-12

5. Some results on star-factor deleted graphs;Filomat;2024