(g,f)-Factorizations of graphs orthogonal to [1,2]-subgraph |
| |
| Authors: | Guiying Yan |
| |
| Institution: | (1) Institute of Applied Mathematics, the Chinese Academy of Sciences, 100080 Beijing, China |
| |
| Abstract: | LetG be a simple graph. Letg(x) andf(x) be integer-valued functions defined onV(G) withf(x) g(x)1 for allx V(G). It is proved that ifG is an (mg+m–1,mf–m+1)-graph andH is a 1,2]-subgraph withm edges, then there exists a (g,f)-factorization ofG orthogonal toH.This work is supported by China Postdoctoral Science Foundation and Shandong Youth Science Foundation. |
| |
| Keywords: | Graph factorization orthogonasl |
| 本文献已被 SpringerLink 等数据库收录！ |
|
