On the complexity of digraph packings
โ
Richard C. Brewster; Romeo Rizzi
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 99 KB
Let G be a fixed collection of digraphs. Given a digraph H , a G-packing of H is a collection of vertex disjoint subgraphs of H , each isomorphic to a member of G. For undirected graphs, Loebl and Poljak have completely characterized the complexity of deciding the existence of a perfect G-packing, i