Decomposing graphs into forests of paths with size less than three
Decomposing graphs into forests of paths with size less than three
复制标题
DOI：
--
复制
发表时间：
1991
期刊：
影响因子：
--
通讯作者：
Bor-Liang Chen;H. Fu;Kuo-Ching Huang
中科院分区：
文献类型：
--
作者：
Bor-Liang Chen;H. Fu;Kuo-Ching Huang
每个组成部分都是路径的森林被称为路径森林。图G的一组路径林，其边集构成图G集合的一个划分，称为G的路径。图G的路径分解中最小的森林数为G的路径数，记为p(G)。如果我们限制每条路径的边数不超过x，那么我们就得到了一个特殊的分解。在本文中，我们注意到，当我们将路径森林的大小限制为1时，数目为G的色指数。在本文中，我们研究了特殊类型的路径，并得到了当G是完全图、树和其他一些图时P2(G)的答案。
A forest in which every component is path is caned a path forest. A family of path forests whose edge sets form a partition of the set of a graph G is called a path of G. The minimum number of forests in a path decomposition of a graph G is the path number of G and denoted by p( G). If we restrict the number of edges in each path to be at most x then we obtain a special decomposition. The minimum number of path forests in this of decomposition is denoted In this paper we study We note here that if we restrict the size to be one, the number the chromatic index of G. In this paper, we study the special type of path and we obtain the answers for P2( G) when G is a complete graph, a tree and some other graphs.