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.
@article{bwmeta1.element.doi-10_7151_dmgt_1974,
author = {Sizhong Zhou and Jiancheng Wu and Tao Zhang},
title = {The Existence Of P$\geq$3-Factor Covered Graphs},
journal = {Discussiones Mathematicae Graph Theory},
volume = {37},
year = {2017},
pages = {1055-1065},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1974}
}
Sizhong Zhou; Jiancheng Wu; Tao Zhang. The Existence Of P≥3-Factor Covered Graphs. Discussiones Mathematicae Graph Theory, Tome 37 (2017) pp. 1055-1065. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1974/