Note on parity factors of regular graphs
classification
🧮 math.CO
keywords
conditionfactorsparityregularedge-connectivityexistencegraphgraphs
read the original abstract
In this paper, we obtain a sufficient condition for the existence of parity factors in a regular graph in terms of edge-connectivity. Moreover, we also show that our condition is sharp.
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.