A neighbourhood condition for graphs to have \([a,b]\)-factors
From MaRDI portal
Publication:1586781
DOI10.1016/S0012-365X(00)00140-0zbMath0966.05062MaRDI QIDQ1586781
Publication date: 16 August 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (10)
A neighborhood condition for fractional ID-\([a,b\)-factor-critical graphs] ⋮ An existence theorem on fractional ID-(g, f)-factor-critical covered graphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Neighborhood-union condition for an \([a, b\)-factor avoiding a specified Hamiltonian cycle] ⋮ Research on fractional critical covered graphs ⋮ On all fractional \({(a,b,k)}\)-critical graphs ⋮ A new degree condition for graphs to have \([a,b\)-factor] ⋮ Fan-type results for the existence of [\(a\),\(b\)-factors] ⋮ Neighborhood union conditions for fractional \([a, b\)-covered graphs] ⋮ A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
This page was built for publication: A neighbourhood condition for graphs to have \([a,b]\)-factors
