Recommendations
- scientific article; zbMATH DE number 3893247
- Some remarks about factors of graphs
- Remarks on component factors in graphs
- Path factors in subgraphs
- Path factors of bipartite graphs
- Degree sums and path-factors in graphs
- Some existence theorems on path factors with given properties in graphs
- On path factorizations of complete multipartite graphs
- Path factorizations of complete multipartite graphs
- Induced path factors of regular graphs
Cited in
(38)- Path factors in subgraphs
- Two Sufficient Conditions for Graphs to Admit Path Factors
- Sufficient conditions for the existence of path-factors with given properties
- Path-factors involving paths of order seven and nine
- A result on fractional \((a,b,k)\)-critical covered graphs
- Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors
- Remarks on component factors
- On \(P_{\geq 3}\)-factor deleted graphs
- Two sufficient conditions for component factors in graphs
- An existence theorem on fractional ID-\((g, f)\)-factor-critical covered graphs
- The existence of subdigraphs with orthogonal factorizations in digraphs
- Discussion on fractional (a, b, k)-critical covered graphs
- Discussions on orthogonal factorizations in digraphs
- Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
- Degree conditions for path-factor critical deleted or covered graphs
- Subgraphs with orthogonal factorizations in graphs
- Binding number and path-factor critical deleted graphs
- Some existence theorems on path factors with given properties in graphs
- Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors
- Component factors and binding number conditions in graphs
- Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
- Some results on path-factor critical avoidable graphs
- Toughness for fractional \((2, b, k)\)-critical covered graphs
- Research on fractional critical covered graphs
- A sufficient condition for the existence of restricted fractional (g, f)-factors in graphs
- Independence number, minimum degree and path-factors in graphs
- Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius
- Path factors and neighborhoods of independent sets in graphs
- Some existence theorems on path-factor critical avoidable graphs
- Sun toughness conditions for \(P_2\) and \(P_3\) factor uniform and factor critical avoidable graphs
- A note on path-zero graphs
- Isolated toughness and \(P_{\ge 3}\)-factors in graphs
- Toughness, isolated toughness and path factors in graphs
- On path-factor critical deleted (or covered) graphs
- A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
- Isolated toughness and path-factor uniform graphs. II.
- Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
This page was built for publication: Remarks on path factors in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3389388)
