Sufficient conditions for a graph to have all [a, b]-factors and (a, b)-parity factors

DOI10.1007/S40840-022-01281-5MaRDI QIDQ2147605zbMATHOpenAlexFDO

Authors Xuechun Zhang, Hongliang Lu, Z. Yang, Yuqing Lin

Publication date 20 June 2022

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40840-022-01281-5

zbMATH Keywords

connectivityindependence number\((aall \((ab)\)-factorsb)\)-parity factor

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A degree condition for a graph to have \((a,b)\)-parity factors
• Publication:4862225
• scientific article; zbMATH DE number 7260013
• Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors
• A Neighborhood Condition for Graphs to Have [a, b]-Factors III

Cites work

• scientific article; zbMATH DE number 1501962 (Why is no real title available?)
• A characterization of graphs having all \((g,f)\)-factors
• A degree condition for fractional \([a,b]\)-covered graphs
• A note on Hamiltonian circuits
• Binding numbers and \(f\)-factors of graphs
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• Independence number, connectivity, and r‐factors
• On the complexity of all \(( g , f )\)-factors problem
• Stability number and [a,b]‐factors in graphs
• The factorization of graphs. II
• Toughness of graphs and the existence of factors

Cited in

(5)

• scientific article; zbMATH DE number 842003 (Why is no real title available?)
• Sufficient conditions for graphs to have strong parity factors
• A spectral condition for a graph to have strong parity factors
• A degree condition for a graph to have \((a,b)\)-parity factors
• A degree condition for graphs having all \((a, b)\)-parity factors

This page was built for publication: Sufficient conditions for a graph to have all \([a, b]\)-factors and \((a, b)\)-parity factors

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