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

A graph $G$ is called a fractional $(g,f)$-covered graph if for any $e\in E(G)$, $G$ admits a fractional $(g,f)$-factor covering $e$. A graph $G$ is called a fractional $(g,f,n)$-critical covered graph if for any $W\subseteq V(G)$ with $|W|=n$, $G-W$ is a fractional $(g,f)$-covered graph. In this pa...

Full description

Bibliographic Details
Main Author: Xiangyang Lv
Format: Article
Language:English
Published: AIMS Press 2020-01-01
Series:AIMS Mathematics
Subjects:
Online Access:https://www.aimspress.com/article/10.3934/math.2020059/fulltext.html