Name
Abstract | ||
|---|---|---|
Let k, m, and r be three integers such that 2≤k≤m≤r. Let G be a 2r-regular, 2m-edge-connected graph of odd order. We obtain some sufficient conditions for G-v to contain a k-factor for all v∈V(G). |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.disc.2011.04.035 | Discrete Mathematics |
Keywords | Field | DocType |
regular factor,vertex-deleted subgraph,connected graph,regular graph,bioinformatics,biomedical research | Integer,Graph,Discrete mathematics,Combinatorics,Strongly regular graph,Vertex (geometry),Regular graph,Distance-regular graph,Mathematics | Journal |
Volume | Issue | ISSN |
311 | 18-19 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hongliang Lu | 1 | 26 | 10.07 |
| Wei Wang | 2 | 81 | 12.64 |
| Bing Bai | 3 | 0 | 0.34 |