Pages that link to "Item:Q617645"
From MaRDI portal
The following pages link to Packing 3-vertex paths in claw-free graphs and related topics (Q617645):
Displaying 17 items.
- On maximum \(P_3\)-packing in claw-free subcubic graphs (Q2025062) (← links)
- Some results on path-factor critical avoidable graphs (Q2107757) (← links)
- A \(5k\)-vertex kernel for \(P_2\)-packing (Q2118855) (← links)
- Component factors and binding number conditions in graphs (Q2142830) (← links)
- On path-factor critical deleted (or covered) graphs (Q2156074) (← links)
- Path factors in subgraphs (Q2161249) (← links)
- Some existence theorems on path factors with given properties in graphs (Q2199110) (← links)
- Block allocation of a sequential resource (Q5217060) (← links)
- TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS (Q5867854) (← links)
- Some results about ID-path-factor critical graphs (Q6063851) (← links)
- The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices (Q6144493) (← links)
- Path-factor critical covered graphs and path-factor uniform graphs (Q6186581) (← links)
- Independence number and minimum degree for path-factor critical uniform graphs (Q6633529) (← links)
- Some results about star-factors in graphs (Q6641098) (← links)
- The maximum 3-star packing problem in claw-free cubic graphs (Q6645157) (← links)
- Characterizing spanning trees via the size or the spectral radius of graphs (Q6657283) (← links)
- On path-factor critical uniform graphs (Q6669293) (← links)
