A Note On Edge Connectivity and Parity Factor
Combinatorics
2013-02-01 v1
Abstract
In this paper, we investigate some parity factors by using Lov\'asz's (g,f)-parity theorem. Let be an integer. Firstly, we obtain a sufficient and necessary condition for some graphs to have a parity factor with restricted minimum degree. Secondly, we obtain some sufficient conditions for a graph to have a parity factor with minimum degree in term of edge connectivity.
Keywords
Cite
@article{arxiv.1301.7565,
title = {A Note On Edge Connectivity and Parity Factor},
author = {Hongliang Lu},
journal= {arXiv preprint arXiv:1301.7565},
year = {2013}
}
Comments
5 pages