Decompositions of Graphs into 5-Cycles and Other Small Graphs
Decompositions of Graphs into 5-Cycles and Other Small Graphs
复制标题
DOI：
10.37236/1946
复制
发表时间：
2005-09
期刊：
影响因子：
--
通讯作者：
Teresa Sousa
中科院分区：
文献类型：
--
作者：
Teresa Sousa
在本文中，我们考虑的问题，找到最小数q$，使任何图$G$的阶$n$承认一个分解成边不相交的副本的固定图$H$和单边与最多$q$元素。我们解决的情况下，当$H$是5-圈，5-圈与弦和任何连接的非二部不完全图的顺序4。
In this paper we consider the problem of finding the smallest number $q$ such that any graph $G$ of order $n$ admits a decomposition into edge disjoint copies of a fixed graph $H$ and single edges with at most $q$ elements. We solve the case when $H$ is the 5-cycle, the 5-cycle with a chord and any connected non-bipartite non-complete graph of order 4.