The Existence Of P≥3-Factor Covered Graphs

Sizhong Zhou, Jiancheng Wu, and Tao Zhang. "The Existence Of P≥3-Factor Covered Graphs." Discussiones Mathematicae Graph Theory 37.4 (2017): 1055-1065. <http://eudml.org/doc/288375>.

@article{SizhongZhou2017,
abstract = {A spanning subgraph F of a graph G is called a P≥3-factor of G if every component of F is a path of order at least 3. A graph G is called a P≥3-factor covered graph if G has a P≥3-factor including e for any e ∈ E(G). In this paper, we obtain three sufficient conditions for graphs to be P≥3-factor covered graphs. Furthermore, it is shown that the results are sharp.},
author = {Sizhong Zhou, Jiancheng Wu, Tao Zhang},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {P≥3-factor; P≥3-factor covered graph; toughness; isolated toughness; regular graph.},
language = {eng},
number = {4},
pages = {1055-1065},
title = {The Existence Of P≥3-Factor Covered Graphs},
url = {http://eudml.org/doc/288375},
volume = {37},
year = {2017},
}

TY - JOUR
AU - Sizhong Zhou
AU - Jiancheng Wu
AU - Tao Zhang
TI - The Existence Of P≥3-Factor Covered Graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2017
VL - 37
IS - 4
SP - 1055
EP - 1065
AB - A spanning subgraph F of a graph G is called a P≥3-factor of G if every component of F is a path of order at least 3. A graph G is called a P≥3-factor covered graph if G has a P≥3-factor including e for any e ∈ E(G). In this paper, we obtain three sufficient conditions for graphs to be P≥3-factor covered graphs. Furthermore, it is shown that the results are sharp.
LA - eng
KW - P≥3-factor; P≥3-factor covered graph; toughness; isolated toughness; regular graph.
UR - http://eudml.org/doc/288375
ER -