Let G be a graph and f an integer-valued function defined on V(G). It is proved that every (0, mf-m +1)-graph G has a (0, f)-factorization orthogonal to any given subgraph with,m edges.
引用
收藏
页码:332 / 336
页数:5
相关论文
共 1 条
[1]
Subgraphs with Proscribed Valencies. Lovasz L. Journal of Combinatorial Theory . 1970