Pages that link to "Item:Q2199110"
From MaRDI portal
The following pages link to Some existence theorems on path factors with given properties in graphs (Q2199110):
Displaying 20 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)
- Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors (Q2023721) (← links)
- Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors (Q2025161) (← links)
- The existence of path-factor covered graphs (Q2107737) (← links)
- Some results on path-factor critical avoidable graphs (Q2107757) (← links)
- The existence of subdigraphs with orthogonal factorizations in digraphs (Q2131531) (← links)
- On path-factor critical deleted (or covered) graphs (Q2156074) (← links)
- A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs (Q2161272) (← links)
- Research on fractional critical covered graphs (Q2211178) (← links)
- A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs (Q2229576) (← links)
- Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs (Q2234788) (← links)
- Toughness for fractional \((2, b, k)\)-critical covered graphs (Q2687688) (← links)
- Remarks on path factors in graphs (Q3389388) (← links)
- Toughness and isolated toughness conditions for path-factor critical covered graphs (Q6045047) (← links)
- Degree conditions for path-factor critical deleted or covered graphs (Q6050605) (← links)
- Path factors and neighborhoods of independent sets in graphs (Q6100418) (← links)
- Binding number and path-factor critical deleted graphs (Q6101463) (← links)
- The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices (Q6144493) (← links)
- Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors (Q6586578) (← links)
- Spectral sufficient conditions for graph factors containing any edge (Q6658863) (← links)
