Bibliographic Details
| Title: |
On edge connectivity and parity factor. |
| Authors: |
Lu, Hong1 luhongliang@mail.xjtu.edu.cn, Wang, Wei1 wangwei@mail.xjtu.edu.cn, Lin, Yuqing2 yuqing.lin@newcastle.edu.au |
| Superior Title: |
Acta Mathematica Sinica. May2015, Vol. 31 Issue 5, p772-776. 5p. |
| Subject Terms: |
*PETERSEN graphs, *GRAPH theory, *MATHEMATICAL proofs, *MATHEMATICAL analysis, *MATHEMATICS |
| Abstract: |
By Petersen's Theorem, a bridgeless cubic graph has a 2-factor. Fleischner ( Discrete Math., 101, 33-37 (1992)) has extended this result to bridgeless graphs of minimum degree at least three by showing that every such graph has an even factor without isolated vertices. Let m > 0 be even and m > 0 be odd. In this paper, we prove that every m-edge-connected graph with minimum degree at least m + 1 contains an even factor with minimum degree at least m and every ( m + 1)-edge-connected graph contains an odd factor with minimum degree at least m, which further extends Fleischner's result. Moreover, we show that our results are best possible. [ABSTRACT FROM AUTHOR] |
|
Copyright of Acta Mathematica Sinica is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Academic Search Premier |