Note on parity factors of regular graphs

2011/10/14 by Hongliang Lu, Lu, Hongliang
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Interconnection Networks and Systems #math.CO

paper · pdf · doi:10.48550/arxiv.1110.3198

arxiv created 2011/10/14 · openalex publication_date 2011/10/14 · arxiv updated 2011/10/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• A Note On Edge Connectivity and Parity Factor
• A characterization for graphs having strong parity factors
• Eigenvalues and parity factors in graphs
• A Degree Condition for Graphs Having All (a,b)-Parity Factors
• A spectral radius condition for a graph to have (a,b)-parity factors