A degree condition for graphs having all \((a, b)\)-parity factors

DOI10.1007/S10255-024-1090-YzbMATH Open1542.05145MaRDI QIDQ6565526

Hongliang Lu, Haodong Liu

Publication date: 2 July 2024

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

zbMATH Keywords

degree conditionsall \((a, b)\)-factors

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On factors with all degrees odd
• Binding numbers and \(f\)-factors of graphs
• A characterization of graphs having all \((g,f)\)-factors
• Some results on odd factors of graphs
• A degree condition for the existence ofk-factors
• Subgraphs with prescribed valencies
• The factorization of graphs. II
• The Factors of Graphs

This page was built for publication: A degree condition for graphs having all \((a, b)\)-parity factors

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