A degree condition for fractional (<i>g, f, n</i>)-critical covered graphs-Reference-Cited by-同舟云学术

A degree condition for fractional (g, f, n)-critical covered graphs

Published:2020 Issue:2 Volume:5 Page:872-878
ISSN:2473-6988
Container-title:AIMS Mathematics
language:en
Short-container-title:

Author:

Lv Xiangyang,

Publisher

American Institute of Mathematical Sciences (AIMS)

Subject

General Mathematics

Link

http://www.aimspress.com/article/10.3934/math.2020059/fulltext.html

Reference23 articles.

1. i>Some results about factors of graphs;J. Correa, M. Matamala;J. Graph Theory

2. i>A new degree condition for graphs to have [a;J. Li;b]-factor, Discrete Mathematics

3. i>A result on r-orthogonal factorizations in digraphs;S. Zhou, Z. Sun, Z. Xu;Eur. J. Combinatorics

4. i>r - k}-factors of r-regular graphs;S. Akbari, M. Kano, {k;Graphs and Combinatorics

5. i>A degree condition for a graph to have [a;Y. Li, M. Cai;b]-factors, J. Graph Theory

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

1. Independence number and connectivity for fractional (a, b, k)-critical covered graphs;RAIRO - Operations Research;2022-07
2. Discussion on Fractional (a, b, k)-critical Covered Graphs;Acta Mathematicae Applicatae Sinica, English Series;2022-04
3. An existence theorem on fractional ID-(g, f)-factor-critical covered graphs;AKCE International Journal of Graphs and Combinatorics;2021-12-01
4. Binding numbers and restricted fractional (g,f)-factors in graphs;Discrete Applied Mathematics;2021-12
5. Toughness for Fractional (2, b, k)-Critical Covered Graphs;Journal of the Operations Research Society of China;2021-07-23