Orthogonal (g,f)-factorizations in graph
β
Guizhen Liu
π
Article
π
1995
π
Elsevier Science
π
English
β 362 KB
LetGbeagraphandletF={F,,F,,..., F,,,} and H be a factorization and a subgraph of G, respectively. If H has exactly one edge in common with Fi for all i, 1 < i < m, then we say that F is orthogonal to H. Let g andf be two integer-valued functions defined on V(G) such that g(x) < f(x) for every x E V(