Independence number, connectivity and fractional (g,f)-factors in graphs

DOI10.2298/FIL1504757BzbMath1391.05194OpenAlexW1808765169MaRDI QIDQ5278594

Qiuju Bian, Si-zhong Zhou

Publication date: 19 July 2017

Published in: Filomat (Search for Journal in Brave)

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

zbMATH Keywords

independence numberconnectivity\((g,f)\)-factorfractional \((g,f\))-factor

Mathematics Subject Classification ID

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

Related Items (3)

Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs ⋮ Parameters and fractional factors in different settings ⋮ Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs

This page was built for publication: Independence number, connectivity and fractional (g,f)-factors in graphs