ORTHOGONAL (G,F)-FACTORIZATIONS IN GRAPHS

被引：23

作者：

LIU, GZ ^{[1
]}

机构：

[1] SHANDONG UNIV,DEPT MATH,JINAN 250100,PEOPLES R CHINA

来源：

DISCRETE MATHEMATICS | 1995年 / 143卷 / 1-3期

关键词：

D O I：

10.1016/0012-365X(94)00033-F

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let G be a graph and let F = {F-1, F-2,..., F-m} and H be a factorization and a subgraph of G, respectively. If H has exactly one edge in common with F-i for all i, 1 less than or equal to i less than or equal to m, then we say that F is orthogonal to H. Let g and f be two integer-valued functions defined on V(G) such that g(x) less than or equal to f(x) for every x is an element of V(G). In this paper it is proved that for any m-matching M of an (mg + m - 1, mf - m + 1)-graph G, there exists a (g, f)-factorization of G orthogonal to M.

引用

页码：153 / 158

页数：6