The existence of even regular factors of regular graphs on the number of cut edges

DOI10.1007/s10114-010-9006-6zbMath1210.05109OpenAlexW2155131920MaRDI QIDQ627564

He Ping Long, Hong Bing Fan, Ji Ping Liu, Gui Zhen Liu

Publication date: 2 March 2011

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-010-9006-6

zbMATH Keywords

regular graphfactorcut edge

Mathematics Subject Classification ID

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

Related Items

Topological minors in bipartite graphs ⋮ Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Sufficient conditions for a graph to have factors
• Minimal regular 2-graphs and applications
• Graph factors and factorization: 1985--2003: a survey
• \(f\)-colorings of some graphs of \(f\)-class 1
• \(k\) -factors in regular graphs
• Regular graphs, regular factors, and the impact of Petersen's theorems
• Regular factors in regular graphs
• Regular factors of regular graphs
• The Factorization of Linear Graphs