The existence of path-factor covered graphs
A \(P_{\geq k}\)-factor of a graph \(G\) is a spanning subgraph with the property that each of its components is isomorphic to a path of order at least \(k\). A \(P_{\geq k}\)-factor covered graph is a graph \(G\) with the property that there is a \(P_{\geq k}\)-factor containing \(e\) for every edge \(e\) of \(G\). This paper gives several sufficient conditions for a graph to be \(P_{\geq 2}\)-factor covered or \(P_{\geq 3}\)-factor covered. To state them, let first \(i(G)\) be the number of isolated vertices of \(G\), and let \[I(G) = \min \Big\{ \frac{|S|}{i(G-S)} \,:\, S \subseteq V(G), i(G - S) \geq 2 \Big\}\] be its isolated toughness (\(I(G) = \infty\) for complete graphs). The following statements hold: \begin{itemize} \item Every connected claw-free graph of minimum degree at least \(2\) is \(P_{\geq 2}\)-factor covered. \item Every connected graph \(G\) with at least two vertices and \(I(G) > \frac23\) is \(P_{\geq 2}\)-factor covered. \item Every connected claw-free graph of minimum degree at least \(3\) is \(P_{\geq 3}\)-factor covered. \item Every 3-connected planar graph is \(P_{\geq 3}\)-factor covered. \end{itemize}
- The existence of \(P_{\geq3}\)-factor covered graphs
- Some existence theorems on path factors with given properties in graphs
- On path-factor critical deleted (or covered) graphs
- scientific article; zbMATH DE number 4033791
- Nontrivial path covers of graphs: existence, minimization and maximization
- Complete-factors and (g,f)-covered graphs
- Well-covered graphs and factors
- The existence of path-factor uniform graphs with large connectivity
- Covering a graph with nontrivial vertex-disjoint paths: existence and optimization
- Partial and perfect path covers of cographs
- A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- Factors and factorizations of graphs—a survey
- Fractional (g,f)-factors in graphs
- Graph factors and factorization: 1985--2003: a survey
- Graph Factors and Matching Extensions
- Graph theory with applications
- scientific article; zbMATH DE number 3720956 (Why is no real title available?)
- On factors with given components
- On packing 3-vertex paths in a graph
- Packing paths of length at least two
- Partitioning vertices of 1-tough graphs into paths
- Path and cycle factors of cubic bipartite graphs
- Path factors in claw-free graphs
- Path factors in cubic graphs
- Path factors of bipartite graphs
- Sufficient conditions for the existence of a path-factor which are related to odd components
- The existence of \(P_{\geq3}\)-factor covered graphs
- The Factors of Graphs
- Tough graphs and Hamiltonian circuits.
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius
- On path-factor critical deleted (or covered) graphs
- Some existence theorems on path factors with given properties in graphs
- The existence of \(P_{\geq3}\)-factor covered graphs
- Closure, path-factors and path coverings in claw-free graphs
- \(\{P_2,C_i\mid i\geq 3\}\)-covered graphs
- A note on path factors in claw-free graphs.
- Path factors and line graphs
- Some degree conditions for \(\mathcal{P}_{\geq k}\)-factor covered graphs
- scientific article; zbMATH DE number 3893247 (Why is no real title available?)
- Some results about component factors in graphs
- Toughness and isolated toughness conditions for path-factor critical covered graphs
- Path factors and neighborhoods of independent sets in graphs
- Binding number and path-factor critical deleted graphs
- Tight toughness bounds for path-factor critical avoidable graphs
- On graph-based network parameters and component factors in networks
- Component factors and degree sum conditions in graphs
- Degree conditions for path-factors in graphs
- Degree sum conditions for path-factor uniform graphs
- The path-factors and generalized distance spectral radius of graphs
- Characterizing path-factor uniform graphs with respect to the degree sum of non-adjacent vertices
- Binding number conditions for path-factor uniform graphs
- Characterizing path-factor deleted graphs via \(Q\)-index and \(\mathcal{D}\)-index
- Sufficient conditions for the existence of path-factors with given properties
- Some spectral conditions for star-factors in bipartite graphs
This page was built for publication: The existence of path-factor covered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107737)
