A degree condition for a graph to have \((a,b)\)-parity factors

DOI10.1016/j.disc.2017.08.035zbMath1372.05042arXiv1606.04608OpenAlexW2963667431MaRDI QIDQ2411624

Hongliang Lu, Haodong Liu

Publication date: 24 October 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

degree conditionparity factor

Mathematics Subject Classification ID

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

Related Items (8)

A neighborhood condition for graphs to have restricted fractional (g,f)-factors ⋮ Sufficient conditions for graphs to have strong parity factors ⋮ Spectral radius conditions for fractional \([a,b\)-covered graphs] ⋮ A degree condition for fractional \([a,b\)-covered graphs] ⋮ A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs ⋮ Unnamed Item ⋮ Neighborhood union conditions for fractional \([a, b\)-covered graphs] ⋮ Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs

Cites Work

• Unnamed Item
• New sufficient conditions for cycles in graphs
• On factors with all degrees odd
• Some results on odd factors of graphs
• A degree condition for the existence ofk-factors
• The factorization of graphs. II

This page was built for publication: A degree condition for a graph to have \((a,b)\)-parity factors