Some degree conditions for P_ k-factor covered graphs
From MaRDI portal
Publication:5034714
Recommendations
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- The existence of path-factor covered graphs
- Toughness and isolated toughness conditions for path-factor critical covered graphs
- The existence of \(P_{\geq3}\)-factor covered graphs
- Some existence theorems on path factors with given properties in graphs
Cited in
(13)- 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
- The existence of \(P_{\geq3}\)-factor covered graphs
- Binding number and path-factor critical deleted graphs
- Path-factor critical covered graphs and path-factor uniform 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
- Characterizing path-factor uniform graphs with respect to the degree sum of non-adjacent vertices
- Binding number conditions for path-factor uniform graphs
- The existence of \(\{P_2,P_5\}\)-factors in graphs
This page was built for publication: Some degree conditions for \(\mathcal{P}_{\geq k}\)-factor covered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5034714)
