Hongliang Lu
Published 2013-01-31Version 1
In this paper, we investigate some parity factors by using Lov\'asz's (g,f)-parity theorem. Let $m>0$ 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 $m$ in term of edge connectivity.
The tau constant and the edge connectivity of a metrized graph
A spectral radius condition for a graph to have $(a,b)$-parity factors
The matching energy of graphs with given edge connectivity
![QR code for arXiv:1301.7565 [math.CO]](http://oss.arxitics.com/images/favicon.svg)