On edge connectivity and parity factor |
| |
Authors: | Hong Liang Lu Wei Wang Yuqing Lin |
| |
Affiliation: | 1. School of Mathematics and Statistic, Xi'an Jiaotong University, Xi'an 710049, P. R. China;2. School of Electrical Engineering and Computer Science, The University of Newcastle, Newcastle NSW2308, Australia |
| |
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 me > 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. |
| |
Keywords: | Edge connectivity parity factor |
本文献已被 CNKI SpringerLink 等数据库收录! |
| 点击此处可从《数学学报(英文版)》浏览原始摘要信息 |
|
点击此处可从《数学学报(英文版)》下载免费的PDF全文 |