Pages that link to "Item:Q5941518"
From MaRDI portal
The following pages link to Partitioning vertices of 1-tough graphs into paths (Q5941518):
Displaying 11 items.
- A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two (Q1400955) (← links)
- Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs (Q2053255) (← links)
- The existence of path-factor covered graphs (Q2107737) (← links)
- On \(P_{\geq 3}\)-factor deleted graphs (Q2115230) (← links)
- On path-factor critical deleted (or covered) graphs (Q2156074) (← links)
- Path factors in subgraphs (Q2161249) (← links)
- The existence of \(P_{\geq3}\)-factor covered graphs (Q2409795) (← links)
- Some sufficient conditions for path-factor uniform graphs (Q2699236) (← links)
- Some results about component factors in graphs (Q5242258) (← links)
- Path factors and neighborhoods of independent sets in graphs (Q6100418) (← links)
- Two Sufficient Conditions for Graphs to Admit Path Factors (Q6125708) (← links)
