## Equistarable bipartite graphs

- Endre Boros, Nina Chiarelli, Martin Milanic
- Discrete Mathematics
- 2016

- Published 2008 in J. Comb. Theory, Ser. B
DOI:10.1016/j.jctb.2007.09.004

Given a (possibly infinite) family S of oriented stars, an S-packing in a digraph D is a collection of vertex disjoint subgraphs of D, each isomorphic to a member of S. The S-PACKING problem asks for the maximum number of vertices, of a host digraph D, that can be covered by an S-packing of D. We prove a dichotomy for the decision version of the S-packing… CONTINUE READING

### Presentations referencing similar topics