The following pages link to Path factors in subgraphs (Q2161249):
Displaying 20 items.
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs (Q2091817) (← links)
- On \(P_{\geq 3}\)-factor deleted graphs (Q2115230) (← links)
- Discussion on fractional \((a, b, k)\)-critical covered graphs (Q2125648) (← links)
- Discussions on orthogonal factorizations in digraphs (Q2125658) (← links)
- On path-factor critical deleted (or covered) graphs (Q2156074) (← links)
- A result on fractional \((a,b,k)\)-critical covered graphs (Q2240647) (← links)
- Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors (Q2243085) (← links)
- Two sufficient conditions for odd \([1,b]\)-factors in graphs (Q2682854) (← links)
- Some sufficient conditions for path-factor uniform graphs (Q2699236) (← links)
- A Note of Generalization of Fractional ID-factor-critical Graphs (Q5044393) (← links)
- An existence theorem on fractional ID-(<i>g</i>, <i>f</i>)-factor-critical covered graphs (Q5074882) (← links)
- TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS (Q5867854) (← links)
- Path factors and neighborhoods of independent sets in graphs (Q6100418) (← links)
- Binding number and path-factor critical deleted graphs (Q6101463) (← links)
- Isolated toughness and path-factor uniform graphs. II. (Q6114133) (← links)
- Degree conditions for the existence of a {<i>P</i><sub>2</sub>, <i>P</i><sub>5</sub>}-factor in a graph (Q6140939) (← links)
- Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius (Q6186333) (← links)
- Sun toughness and path-factor uniform graphs (Q6186566) (← links)
- Path-factor critical covered graphs and path-factor uniform graphs (Q6186581) (← links)
- The \(A_\alpha\)-spectral radius for path-factors in graphs (Q6204351) (← links)