Name
Abstract | ||
|---|---|---|
Let G be a simple graph with order n and minimum degree at least two. In this paper, we prove that if every odd branch-bond in G has an edge-branch, then its line graph has a 2-factor with at most ${{3n - 2}\over {8}}$ components. For a simple graph with minimum degree at least three also, the same conclusion holds. © 2007 Wiley Periodicals, Inc. J Graph Theory 55: 72–82, 2007 |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1002/jgt.v55:1 | Journal of Graph Theory |
Keywords | Field | DocType |
order n,wiley periodicals,line graph,odd branch-bond,inc. j graph theory,simple graph,minimum degree,upper bound | Discrete mathematics,Combinatorics,Line graph,Graph power,Cubic graph,Regular graph,Degree (graph theory),Distance-regular graph,Voltage graph,Mathematics,Complement graph | Journal |
Volume | Issue | ISSN |
55 | 1 | 0364-9024 |
Citations | PageRank | References |
9 | 0.84 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jun Fujisawa | 1 | 9 | 1.51 |
| Liming Xiong | 2 | 82 | 27.88 |
| Kiyoshi Yoshimoto | 3 | 133 | 22.65 |
| Shenggui Zhang | 4 | 263 | 47.21 |