Simplified existence theorems on all fractional \([a,b]\)-factors

DOI10.1016/j.dam.2013.02.006zbMath1286.05139arXiv1103.3983OpenAlexW2963979632MaRDI QIDQ2446850

Hongliang Lu

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

zbMATH Keywords

fractional factorall fractional factors

Mathematics Subject Classification ID

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

Related Items

A neighborhood union condition for fractional ID-\([a, b\)-factor-critical graphs] ⋮ A neighborhood condition for fractional ID-\([a,b\)-factor-critical graphs] ⋮ Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs ⋮ Spectral radius and \([a,b\)-factors in graphs] ⋮ Existence of all generalized fractional \((g, f)\)-factors of graphs ⋮ Two sufficient conditions for odd \([1,b\)-factors in graphs] ⋮ On all fractional \({(a,b,k)}\)-critical graphs ⋮ Nash-Williams conditions for the existence of all fractional \([a,b\)-factors] ⋮ Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties ⋮ 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\)]

Cites Work

• Binding numbers and \(f\)-factors of graphs
• A characterization of graphs having all \((g,f)\)-factors
• Simplified existence theorems for \((g,f)\)-factors
• Subgraphs with prescribed valencies