A Note On Edge Connectivity and Parity Factor

arXiv1301.7565MaRDI QIDQ6239231FDOQ6239231

Authors: Hongliang Lü 

Publication date: 31 January 2013

Abstract: 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.

This page was built for publication: A Note On Edge Connectivity and Parity Factor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6239231)