Isolated toughness and path-factor uniform graphs
From MaRDI portal
Recommendations
- Isolated toughness and path-factor uniform graphs. II.
- Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
- The existence of path-factor uniform graphs with large connectivity
- Toughness, isolated toughness and path factors in graphs
- Toughness and isolated toughness conditions for path-factor critical covered graphs
Cited in
(15)- Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
- A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
- Component factors and binding number conditions in graphs
- On path-factor critical deleted (or covered) graphs
- Path factors in subgraphs
- A result on fractional \((a,b,k)\)-critical covered graphs
- Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors
- Some sufficient conditions for path-factor uniform graphs
- An existence theorem on fractional ID-\((g, f)\)-factor-critical covered graphs
- Isolated toughness for path factors in networks
- Toughness, isolated toughness and path factors in graphs
- Toughness and binding number bounds of star-like and path factor
- Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor
- Isolated toughness and path-factor uniform graphs. II.
- Sun toughness and path-factor uniform graphs
This page was built for publication: Isolated toughness and path-factor uniform graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5001395)
