The following pages link to (Q2816101):
Displaying 13 items.
- Complexity of the packing coloring problem for trees (Q972338) (← links)
- On the complexity of digraph packings (Q1007581) (← links)
- Generalizations of matched CNF formulas (Q1777405) (← links)
- Generalized edge packings (Q1825138) (← links)
- On partial descriptions of König graphs for odd paths and all their spanning supergraphs (Q2115309) (← links)
- A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs (Q2192977) (← links)
- About a new class of matroid-inducing packing families (Q2370439) (← links)
- Packing bipartite graphs with covers of complete bipartite graphs (Q2442206) (← links)
- Oriented star packings (Q2483479) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
- König Graphs with Respect to the 4-Path and Its Spanning Supergraphs (Q4973244) (← links)
- The Nonnegative Node Weight <i>j</i>-Restricted <i>k</i>-Matching Problems (Q5244876) (← links)
- On König graphs with respect to P4 (Q5374003) (← links)
