A sufficient condition for a graph to have \([a,b]\)-factors
From MaRDI portal
Publication:1173656
DOI10.1007/BF01787576zbMath0746.05051MaRDI QIDQ1173656
Publication date: 25 June 1992
Published in: Graphs and Combinatorics (Search for Journal in Brave)
neighborhoods\([a,b\)-factors]
Related Items (9)
A neighborhood condition for graphs to have restricted fractional (g,f)-factors ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Two sufficient conditions for odd \([1,b\)-factors in graphs] ⋮ A result on fractional \((a,b,k)\)-critical covered graphs ⋮ Binding numbers and \(f\)-factors of graphs ⋮ Notes on the binding numbers for (a, b, k)-critical graphs ⋮ Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs ⋮ A sufficient condition for a graph to be an (a, b, k)-critical graph ⋮ Neighbourhood conditions for fractional ID-[a, b-factor-critical graphs]
Cites Work
- On factors with given components
- Graph factors
- Perfect matchings of a graph
- Factors and factorizations of graphs—a survey
- Some results on odd factors of graphs
- Subgraphs with prescribed valencies
- The binding number of a graph and its Anderson number
- A sufficient condition for a bipartite graph to have a k‐factor
- Unnamed Item
- Unnamed Item
This page was built for publication: A sufficient condition for a graph to have \([a,b]\)-factors
