Pages that link to "Item:Q1400955"
From MaRDI portal
The following pages link to 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):
Displaying 50 items.
- Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs (Q497365) (← links)
- Packing 3-vertex paths in claw-free graphs and related topics (Q617645) (← links)
- A note on \({\mathtt V}\)-free 2-matchings (Q727204) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Path-factors in the square of a tree (Q937248) (← links)
- Component factors with large components in graphs (Q963816) (← links)
- Path factors and parallel knock-out schemes of almost claw-free graphs (Q968408) (← links)
- On path factors of \((3,4)\)-biregular bigraphs (Q1014829) (← links)
- Packing trees with constraints on the leaf degree (Q1014830) (← links)
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs (Q1025460) (← links)
- The existence of a path-factor without small odd paths (Q1753005) (← links)
- Packing paths of length at least two (Q1827782) (← links)
- Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius (Q1981717) (← links)
- Sun toughness conditions for \(P_2\) and \(P_3\) factor uniform and factor critical avoidable graphs (Q2051657) (← links)
- Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs (Q2053255) (← links)
- The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree (Q2093104) (← links)
- The existence of path-factor covered graphs (Q2107737) (← links)
- Some results on path-factor critical avoidable graphs (Q2107757) (← links)
- On \(P_{\geq 3}\)-factor deleted graphs (Q2115230) (← links)
- Path cover problems with length cost (Q2154120) (← 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)
- Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs (Q2234788) (← links)
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs (Q2286579) (← links)
- An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem (Q2288180) (← links)
- The existence of \(P_{\geq3}\)-factor covered graphs (Q2409795) (← links)
- Packing paths: recycling saves time (Q2446295) (← links)
- The path partition problem and related problems in bipartite graphs (Q2465958) (← links)
- \(P_3\)-factors in the square of a tree (Q2657058) (← links)
- Some sufficient conditions for path-factor uniform graphs (Q2699236) (← links)
- Packingk-edge trees in graphs of restricted vertex degrees (Q3594953) (← links)
- Path factors in cubic graphs (Q3651178) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
- Some results about component factors in graphs (Q5242258) (← links)
- The Nonnegative Node Weight <i>j</i>-Restricted <i>k</i>-Matching Problems (Q5244876) (← links)
- (Q5708503) (← links)
- TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS (Q5867854) (← links)
- Some results about ID-path-factor critical graphs (Q6063851) (← links)
- Path cover problems with length cost (Q6069927) (← links)
- Remarks on component factors (Q6093996) (← 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)
- Faster algorithm for finding maximum 1-restricted simple 2-matchings (Q6119828) (← links)
- Two Sufficient Conditions for Graphs to Admit Path Factors (Q6125708) (← links)
- The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices (Q6144493) (← links)
- Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius (Q6186333) (← links)
- Sun toughness and path-factor uniform graphs (Q6186566) (← links)
- Path-factor critical covered graphs and path-factor uniform graphs (Q6186581) (← links)
