排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
David R. Wood 《Journal of Combinatorial Theory, Series B》2004,90(2):309
An acyclic decomposition of a digraph is a partition of the edges into acyclic subgraphs. Trivially every digraph has an acyclic decomposition into two subgraphs. It is proved that for every integer s2 every digraph has an acyclic decomposition into s subgraphs such that in each subgraph the outdegree of each vertex v is at most
. For all digraphs this degree bound is optimal. 相似文献
1