A Note On Edge Connectivity and Parity Factor
classification
🧮 math.CO
keywords
parityfactorsomeconnectivitydegreeedgeminimumobtain
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.