Name
Abstract | ||
|---|---|---|
. Let G be a simple graph. Let g(x) and f(x) be integer-valued functions defined on V(G) with g(x)≥2 and f(x)≥5 for all x∈V(G). It is proved that if G is an (mg+m−1, mf−m+1)-graph and H is a subgraph of G with m edges, then there exists a (g,f)-factorization of G orthogonal to H. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/s003730050070 | Graphs and Combinatorics |
Keywords | Field | DocType |
value function | Graph,Combinatorics,Mathematics | Journal |
Volume | Issue | ISSN |
15 | 3 | 0911-0119 |
Citations | PageRank | References |
1 | 0.37 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guiying Yan | 1 | 196 | 22.92 |