Simplified existence theorems on all fractional \([a,b]\)-factors
From MaRDI portal
Publication:2446850
DOI10.1016/j.dam.2013.02.006zbMath1286.05139arXiv1103.3983MaRDI QIDQ2446850
Publication date: 22 April 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1103.3983
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
A neighborhood condition for fractional ID-\([a,b\)-factor-critical graphs], A neighborhood union condition for fractional ID-\([a, b\)-factor-critical graphs], Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs, Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties, Discussion on fractional \((a, b, k)\)-critical covered graphs, Spectral radius and \([a,b\)-factors in graphs], Existence of all generalized fractional \((g, f)\)-factors of graphs, Nash-Williams conditions for the existence of all fractional \([a,b\)-factors], Toughness condition for the existence of all fractional \((a, b, k)\)-critical graphs, Characterizations of graphs \(G\) having all \([1, k\)-factors in \(k G\)], On all fractional \({(a,b,k)}\)-critical graphs, Two sufficient conditions for odd \([1,b\)-factors in graphs]
Cites Work
