New isolated toughness condition for fractional $(g,f,n)$-critical graphs

DOI10.4064/cm6713-8-2016zbMath1358.05228OpenAlexW2560327106MaRDI QIDQ2966787

Wei Gao, Wei Fan Wang

Publication date: 8 March 2017

Published in: Colloquium Mathematicum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/cm6713-8-2016

zbMATH Keywords

fractional \((g,f,n)\)-critical graphfractional \((g,f)\)-factorisolated toughness

Mathematics Subject Classification ID

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

Related Items (13)

A neighborhood condition for graphs to have restricted fractional (g,f)-factors ⋮ Feasibility of data transmission under attack: from isolated toughness variant perspective ⋮ Binding numbers and restricted fractional \(( g , f )\)-factors in graphs ⋮ Nash-Williams conditions for the existence of all fractional \([a,b\)-factors] ⋮ Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs ⋮ A toughness condition for fractional \((k, m)\)-deleted graphs revisited ⋮ Parameters and fractional factors in different settings ⋮ An independent set degree condition for fractional critical deleted graphs ⋮ Analysis of the clustering fusion algorithm for multi-band color image ⋮ Research on the matching algorithm for heterologous image after deformation in the same scene ⋮ Tight isolated toughness bound for fractional \((k, n)\)-critical graphs ⋮ A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs ⋮ TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS

This page was built for publication: New isolated toughness condition for fractional $(g,f,n)$-critical graphs