Pages that link to "Item:Q1068852"
From MaRDI portal
The following pages link to Packings by cliques and by finite families of graphs (Q1068852):
Displayed 33 items.
- Maker-Breaker domination game (Q776271) (← links)
- Chain packing in graphs (Q808291) (← links)
- On the complexity of digraph packings (Q1007581) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- Edge decompositions into two kinds of graphs (Q1045169) (← links)
- On the complexity of a family of generalized matching problems (Q1068535) (← links)
- On matroids induced by packing subgraphs (Q1109053) (← links)
- On the use of augmenting chains in chain packings (Q1174179) (← links)
- On the tree packing problem (Q1183337) (← links)
- Generalized partitions of graphs (Q1283792) (← links)
- Optimal packing of induced stars in a graph (Q1367032) (← links)
- Maximum tree-packing in time \(O(n^{5/2})\) (Q1391314) (← links)
- On the complexity of some edge-partition problems for graphs (Q1923590) (← links)
- On maximum \(P_3\)-packing in claw-free subcubic graphs (Q2025062) (← links)
- An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem (Q2288180) (← links)
- Pareto optimality in coalition formation (Q2437839) (← links)
- Oriented star packings (Q2483479) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- A greedy algorithm for the social golfer and the Oberwolfach problem (Q2670589) (← links)
- Edge decompositions and rooted packings of graphs (Q2675822) (← links)
- Packings by Complete Bipartite Graphs (Q3728943) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
- (Q4691867) (← links)
- (Q4711754) (← links)
- The Nonnegative Node Weight <i>j</i>-Restricted <i>k</i>-Matching Problems (Q5244876) (← links)
- Approximation algorithms and hardness results for the clique packing problem (Q5900079) (← links)
- Approximation algorithms and hardness results for the clique packing problem (Q5902134) (← links)
- Chain partitions of ordered sets (Q5917347) (← links)
- Maximum tree-packing in time O(n5/2) (Q6085700) (← links)
- Packing 2- and 3-stars into cubic graphs (Q6095048) (← links)
- The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices (Q6144493) (← links)
- How many matchings cover the nodes of a graph? (Q6201927) (← links)
- Approximating the directed path partition problem (Q6204168) (← links)