The existence of path-factor covered graphs
From MaRDI portal
Publication:2107737
Recommendations
- 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
Cites work
- scientific article; zbMATH DE number 3720956 (Why is no real title available?)
- 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 Matching Extensions
- Graph factors and factorization: 1985--2003: a survey
- Graph theory with applications
- 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 Factors of Graphs
- The existence of \(P_{\geq3}\)-factor covered graphs
- Tough graphs and Hamiltonian circuits.
Cited in
(20)- Path factors and line graphs
- A note on path factors in claw-free graphs.
- Binding number and path-factor critical deleted graphs
- Some existence theorems on path factors with given properties in graphs
- Toughness and isolated toughness conditions for path-factor critical covered graphs
- Closure, path-factors and path coverings in claw-free graphs
- scientific article; zbMATH DE number 3893247 (Why is no real title available?)
- The existence of \(P_{\geq3}\)-factor covered graphs
- Path factors and neighborhoods of independent sets in graphs
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- Some degree conditions for \(\mathcal{P}_{\geq k}\)-factor covered 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
- On path-factor critical deleted (or covered) graphs
- \(\{P_2,C_i\mid i\geq 3\}\)-covered graphs
- Some results about component factors in graphs
- Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius
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)