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

DOI10.1007/S40840-022-01281-5zbMATH Open1491.05117OpenAlexW4223509598MaRDI QIDQ2147605FDOQ2147605

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

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

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)

Cites Work

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

Cited In (5)

• A degree condition for graphs having all \((a, b)\)-parity factors
• Sufficient conditions for graphs to have strong parity factors
• A degree condition for a graph to have \((a,b)\)-parity factors
• A spectral condition for a graph to have strong parity factors
• Title not available (Why is that?)

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)