Binding numbers for all fractional (a, b, k)-critical graphs

DOI10.2298/FIL1404709ZzbMath1464.05314OpenAlexW1966757225MaRDI QIDQ2975510

Qiuxiang Bian, Si-zhong Zhou, Zhi-ren Sun

Publication date: 11 April 2017

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1404709z

zbMATH Keywords

binding numberall fractional \([a,b\)-factors]fractional \([a,b\)-factor]all fractional \([a,b\)-critical factors]

Mathematics Subject Classification ID

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

Related Items (3)

Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs ⋮ Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs ⋮ Some results about component factors in graphs

This page was built for publication: Binding numbers for all fractional (a, b, k)-critical graphs