The existence of P₃-factor covered graphs
From MaRDI portal
Publication:2409795
Recommendations
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- The existence of path-factor covered graphs
- Some degree conditions for \(\mathcal{P}_{\geq k}\)-factor covered graphs
- scientific article; zbMATH DE number 4191728
- \(\{P_2,C_i\mid i\geq 3\}\)-covered graphs
- Complete-factors and (g,f)-covered graphs
- scientific article; zbMATH DE number 7774082
- An existence theorem on fractional ID-\((g, f)\)-factor-critical covered graphs
- scientific article; zbMATH DE number 4033791
- Existence of 3-factors in \(K_{1,n}\)-free graphs with connectivity and edge-connectivity conditions
Cites work
- \(K_{1,3}\)-factors in graphs
- A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
- A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- Component factors with large components in graphs
- Factors and factorizations of graphs. Proof techniques in factor theory
- Fractional (g,f)-factors in graphs
- scientific article; zbMATH DE number 3720956 (Why is no real title available?)
- Independence number, connectivity and \((a,b,k)\)-critical graphs
- Packing paths of length at least two
- Partitioning vertices of 1-tough graphs into paths
- Star-factors with large components
- Star-like factors with large components
- Subdigraphs with orthogonal factorizations of digraphs. II
- Sufficient condition for the existence of an even \([a,b]\)-factor in graph
- Tough graphs and Hamiltonian circuits.
- Toughness and fractional critical deleted graph
- Toughness and the existence of fractional k-factors of graphs
Cited in
(25)- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs
- Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius
- Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
- The existence of path-factor covered graphs
- Path cover problems with length cost
- Some existence theorems on path factors with given properties in graphs
- \(\{P_2,C_i\mid i\geq 3\}\)-covered graphs
- \(P_3\)-factor in line graphs of trees
- P₃-factors in the line graphs of 2-edge-connected graphs
- Some degree conditions for \(\mathcal{P}_{\geq k}\)-factor covered graphs
- scientific article; zbMATH DE number 3893247 (Why is no real title available?)
- Toughness, isolated toughness and path factors in graphs
- scientific article; zbMATH DE number 7774082 (Why is no real title available?)
- Path cover problems with length cost
- Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor
- Path factors and neighborhoods of independent sets in 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 sum conditions for path-factor uniform graphs
- Sufficient conditions for component factors in a graph
- Tight toughness, isolated toughness and binding number bounds for the \(\{K_2, C_n\}\)-factors
- Characterizing path-factor deleted graphs via \(Q\)-index and \(\mathcal{D}\)-index
- Sufficient conditions for the existence of path-factors with given properties
This page was built for publication: The existence of \(P_{\geq3}\)-factor covered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409795)
