The Existence Of P≥3-Factor Covered Graphs
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 co...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2017-11-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.1974 |
| id |
doaj-bf41914a4aef428483b625d0ae3f99b4 |
|---|---|
| record_format |
Article |
| spelling |
doaj-bf41914a4aef428483b625d0ae3f99b42021-09-05T17:20:22ZengSciendoDiscussiones Mathematicae Graph Theory2083-58922017-11-013741055106510.7151/dmgt.1974dmgt.1974The Existence Of P≥3-Factor Covered GraphsZhou Sizhong0Wu Jiancheng1Zhang Tao2School of Mathematics and Physics Jiangsu University of Science and Technology Mengxi Road 2, Zhenjiang, Jiangsu 212003, P.R. ChinaSchool of Mathematics and Physics Jiangsu University of Science and Technology Mengxi Road 2, Zhenjiang, Jiangsu 212003, P.R. ChinaSchool of Economic and Management Jiangsu University of Science and Technology Mengxi Road 2, Zhenjiang, Jiangsu 212003, P.R. ChinaA 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.https://doi.org/10.7151/dmgt.1974p≥3-factorp≥3-factor covered graphtoughnessisolated toughnessregular graph. |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Zhou Sizhong Wu Jiancheng Zhang Tao |
| spellingShingle |
Zhou Sizhong Wu Jiancheng Zhang Tao The Existence Of P≥3-Factor Covered Graphs Discussiones Mathematicae Graph Theory p≥3-factor p≥3-factor covered graph toughness isolated toughness regular graph. |
| author_facet |
Zhou Sizhong Wu Jiancheng Zhang Tao |
| author_sort |
Zhou Sizhong |
| title |
The Existence Of P≥3-Factor Covered Graphs |
| title_short |
The Existence Of P≥3-Factor Covered Graphs |
| title_full |
The Existence Of P≥3-Factor Covered Graphs |
| title_fullStr |
The Existence Of P≥3-Factor Covered Graphs |
| title_full_unstemmed |
The Existence Of P≥3-Factor Covered Graphs |
| title_sort |
existence of p≥3-factor covered graphs |
| publisher |
Sciendo |
| series |
Discussiones Mathematicae Graph Theory |
| issn |
2083-5892 |
| publishDate |
2017-11-01 |
| description |
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. |
| topic |
p≥3-factor p≥3-factor covered graph toughness isolated toughness regular graph. |
| url |
https://doi.org/10.7151/dmgt.1974 |
| work_keys_str_mv |
AT zhousizhong theexistenceofp3factorcoveredgraphs AT wujiancheng theexistenceofp3factorcoveredgraphs AT zhangtao theexistenceofp3factorcoveredgraphs AT zhousizhong existenceofp3factorcoveredgraphs AT wujiancheng existenceofp3factorcoveredgraphs AT zhangtao existenceofp3factorcoveredgraphs |
| _version_ |
1717786466860400640 |