(g,f)-factorizations of graphs orthogonal to [1,2]-subgraph

被引：0

作者：

Yan G. ^{[1
]}

机构：

[1] Institute of Applied Mathematics, Chinese Academy of Sciences

来源：

Acta Mathematicae Applicatae Sinica | 1997年 / 13卷 / 4期

基金：

中国博士后科学基金;

关键词：

Factorization; Graph; Orthogonasl;

D O I：

10.1007/BF02009545

中图分类号：

学科分类号：

摘要：

Let G be a simple graph. Let g(x) and f(x) be integer-valued functions defined on V(G) with f(x)≥g(x)≥1 for all x∈V(G). It is proved that if G is an (mg+m-1,mf-m+1)-graph and H is a [1,2]-subgraph with m edges, then there exists a (g,f)-factorization of G orthogonal to H.

引用

页码：371 / 375

页数：4