Note on parity factors of regular graphs

DOI10.5614/EJGTA.2013.1.1.5MaRDI QIDQ5177021zbMATH OpenOpenAlexFDO

Authors Hongliang Lu, Yuqing Lin

Publication date 5 March 2015

Published in Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://arxiv.org/abs/1110.3198

zbMATH Keywords

edge connectivityparity factors

Mathematics Subject Classification ID

Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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.

Recommendations

• On edge connectivity and parity factor
• Regular factors in regular multipartite graphs
• scientific article; zbMATH DE number 21650
• Regular factors in regular graphs
• A characterization of graphs without even factors

Cited in

(4)

• Regular factors in regular multipartite graphs
• Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs
• Odd facial colorings of acyclic plane graphs
• Elementary graphs with respect to \(f\)-parity factors

This page was built for publication: Note on parity factors of regular graphs

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