A Note On Edge Connectivity and Parity Factor

Published 31 Jan 2013 in math.CO | (1301.7565v1)

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.

Abstract PDF Upgrade to Chat

Authors (1)

Hongliang Lu

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.