General fractional \(f\)-factor numbers of graphs

DOI10.1016/j.aml.2010.11.005zbMath1215.05133OpenAlexW1969726110MaRDI QIDQ617025

Qinglin Yu, Hongliang Lu

Publication date: 20 January 2011

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2010.11.005

zbMATH Keywords

\(f\)-factordeficiencyfractional matchingalternating trailfractional number

Mathematics Subject Classification ID

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

Related Items

Discussion on fractional \((a, b, k)\)-critical covered graphs, Toughness for fractional \((2, b, k)\)-critical covered graphs, Research on fractional critical covered graphs

Cites Work

• Constructive proof of deficiency theorem of \((g,f)\)-factor
• Matching theory
• Simplified existence theorems for \((g,f)\)-factors
• The fractional matching numbers of graphs
• Subgraphs with prescribed valencies