Pages that link to "Item:Q5867854"
From MaRDI portal
The following pages link to TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS (Q5867854):
Displaying 17 items.
- Tight isolated toughness bound for fractional \((k, n)\)-critical graphs (Q2081483) (← links)
- Discussion on fractional \((a, b, k)\)-critical covered graphs (Q2125648) (← links)
- Discussions on orthogonal factorizations in digraphs (Q2125658) (← 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)
- Some results about ID-path-factor critical graphs (Q6063851) (← links)
- Packing 2- and 3-stars into cubic graphs (Q6095048) (← links)
- Path factors and neighborhoods of independent sets in graphs (Q6100418) (← 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)
- Sufficient conditions for graphs to have strong parity factors (Q6140954) (← links)
- The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices (Q6144493) (← 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)
- A sufficient condition for a graph to be fractional \((k,n)\)-critical (Q6494951) (← links)
