共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
Dong Han Kim 《Theoretical computer science》2011,412(29):3413-3417
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
Let be a fixed collection of digraphs. Given a digraph H, a -packing of H is a collection of vertex disjoint subgraphs of H, each isomorphic to a member of . For undirected graphs, Loebl and Poljak have completely characterized the complexity of deciding the existence of a perfect -packing, in the case that consists of two graphs one of which is a single edge on two vertices. We characterize -packing where consists of two digraphs one of which is a single arc on two vertices. 相似文献
17.
18.
19.