The following pages link to Efficient subgraphs packing (Q1321999):
Displaying 20 items.
- Induced graph packing problems (Q604669) (← links)
- Packing 3-vertex paths in claw-free graphs and related topics (Q617645) (← links)
- On the complexity of digraph packings (Q1007581) (← links)
- Edge decompositions into two kinds of graphs (Q1045169) (← links)
- Optimal packing of induced stars in a graph (Q1367032) (← links)
- Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles (Q1637143) (← links)
- The existence of a path-factor without small odd paths (Q1753005) (← links)
- Generalized edge packings (Q1825138) (← links)
- The superstar packing problem (Q2149487) (← links)
- About a new class of matroid-inducing packing families (Q2370439) (← links)
- Matchings of cycles and paths in directed graphs (Q2460633) (← links)
- Oriented star packings (Q2483479) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- Edge decompositions and rooted packings of graphs (Q2675822) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
- (Q4691867) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- The Nonnegative Node Weight <i>j</i>-Restricted <i>k</i>-Matching Problems (Q5244876) (← links)
- The maximum 3-star packing problem in claw-free cubic graphs (Q6645157) (← links)
