- Title
- On edge connectivity and parity factor
- Creator
- Lu, Hong Liang; Wang, Wei; Lin, Yuqing
- Relation
- Acta Mathematica Sinica Vol. 31, Issue 5, p. 772-776
- Publisher Link
- http://dx.doi.org/10.1007/s10114-015-4104-0
- Publisher
- Springer
- Resource Type
- journal article
- Date
- 2015
- Description
- 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 mee > 0 be even and mo > 0 be odd. In this paper, we prove that every me-edge-connected graph with minimum degree at least me + 1 contains an even factor with minimum degree at least me and every (mo + 1)-edge-connected graph contains an odd factor with minimum degree at least mo, which further extends Fleischner’s result. Moreover, we show that our results are best possible.
- Subject
- edge connectivity; parity factor
- Identifier
- http://hdl.handle.net/1959.13/1315615
- Identifier
- uon:22972
- Identifier
- ISSN:1439-8516
- Language
- eng
- Reviewed
- Hits: 838
- Visitors: 829
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|