The Existence of Path-Factor Covered Graphs

Abstract

A spanning subgraph H of a graph G is called a P≥k-factor of G if every component of H is isomorphic to a path of order at least k, where k ≥ 2. A graph G is called a P≥k-factor covered graph if there is a P≥k-factor of G covering e for any e ∈ E(G). In this paper, we obtain two special classes of P≥2-factor covered graphs. We also obtain two special classes of P≥3-factor covered graphs. Furthermore, it is shown that these results are all sharp.

Keywords

• path-factor
• p≥2-factor covered graph
• p≥3-factor covered graph
• claw-free graph
• isolated toughness
• 05c70
• 05c38