抄録
An m-covering of a graph G is a spanning subgraph of G with maximum degree at most m. In this paper, we shall show that every 3-connected graph on a surface with Euler genus k ≥ 2 with sufficiently large representativity has a 2-connected 7-covering with at most 6k - 12 vertices of degree 7. We also construct, for every surface F2 with Euler genus k ≥ 2, a 3-connected graph G on F2 with arbitrarily large representativity each of whose 2-connected 7-coverings contains at least 6k - 12 vertices of degree 7.
| 本文言語 | English |
|---|---|
| ページ（範囲） | 26-36 |
| ページ数 | 11 |
| ジャーナル | Journal of Graph Theory |
| 巻 | 43 |
| 号 | 1 |
| DOI | |
| 出版ステータス | Published - 2003 5月 |
ASJC Scopus subject areas
- 幾何学とトポロジー
- 離散数学と組合せ数学