Department of Computer Science and Technology,Beijing Broadcasting Institute, Beijing 100024, China
{{custom_zuoZheDiZhi}}
{{custom_authorNodes}}
{{custom_bio.content}}
{{custom_bio.content}}
{{custom_authorNodes}}
折叠
TREE DECOMPOSITIONS OF MULTIGRAPHS
Min Yong SHI
Author information+
Department of Computer Science and Technology,Beijing Broadcasting Institute, Beijing 100024, China
{{custom_zuoZheDiZhi}}
{{custom_authorNodes}}
{{custom_bio.content}}
{{custom_bio.content}}
{{custom_authorNodes}}
Collapse
文章历史+
收稿日期
修回日期
出版日期
1900-01-01
1900-01-01
1999-07-15
发布日期
1999-07-15
摘要
For a graph G, if E(G) can be partitioned into several pairwise disjoint sets as{E1 , E2,...,El } such that the subgraph induced by Ei is a tree of order ki ) (i = 1, 2,... , l),then G is said to have a {k1, k2, ..., kl }-tree-decomposition.
Abstract
For a graph G, if E(G) can be partitioned into several pairwise disjoint sets as{E1 , E2,...,El } such that the subgraph induced by Ei is a tree of order ki ) (i = 1, 2,... , l),then G is said to have a {k1, k2, ..., kl }-tree-decomposition.
PDF(479 KB)
