关于f—复盖图

On f—Covered Graphs

如果图G的每一条边都属于一个f一因子,则称图G是f-复盖的。本文给出了一个图是f-复盖的充分必要条件,并且证明了若图G是m-复盖的及n-复盖的,m,n,k有同样的奇偶性且m<k<n,则G是-k复盖的。

A graph G is called f-covered if each edge of G belongs to a f-factor. A necessary and sufficient condition for a graph to be f-covered is given and it is proved that if a graph G is m-covered and n-cocered, then G is k-covered where m, n and k are integers with the same parity and m<k<n.