抄録
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/8 components. For a simple graph with minimum degree at least three also, the same conclusion holds.
本文言語 | English |
---|---|
ページ(範囲) | 72-82 |
ページ数 | 11 |
ジャーナル | Journal of Graph Theory |
巻 | 55 |
号 | 1 |
DOI | |
出版ステータス | Published - 2007 5 |
外部発表 | はい |
ASJC Scopus subject areas
- Geometry and Topology