Binding numbers and [a,b]-factors excluding a given k-factor
From MaRDI portal
Publication:643606
DOI10.1016/J.CRMA.2011.08.007zbMATH Open1283.05229OpenAlexW2012299089MaRDI QIDQ643606FDOQ643606
Authors: Sizhong Zhou 
Publication date: 2 November 2011
Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.crma.2011.08.007
Recommendations
- A sufficient condition for the existence of a \(k\)-factor excluding a given \(r\)-factor
- Binding numbers of graphs and the existence of \([a,b]\)-factors
- Degree conditions for graphs to have \([a,b]\)-factors excluding a given \(k\)-factors
- scientific article; zbMATH DE number 844163
- Binding numbers and \((a,b,k)\)-critical graphs.
Cites Work
- Graph theory with applications
- Independence number, connectivity and \((a,b,k)\)-critical graphs
- Subgraphs with prescribed valencies
- The binding number of a graph and its Anderson number
- Fan-type results for the existence of [\(a\),\(b\)]-factors
- Notes on the binding numbers for (a, b, k)-critical graphs
- The existence of \(k\)-factors in squares of graphs
- BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
- Toughness and \((a,b,k)\)-critical graphs
- Binding number and Hamiltonian \((g,f)\)-factors in graphs
- Degree conditions for graphs to have \([a,b]\)-factors excluding a given \(k\)-factors
Cited In (11)
- Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs
- Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs
- Binding numbers of graphs and the existence of \([a,b]\)-factors
- On all fractional \({(a,b,k)}\)-critical graphs
- Title not available (Why is that?)
- Neighbourhood conditions for fractional ID-\([a,b]\)-factor-critical graphs
- A sufficient condition for the existence of a \(k\)-factor excluding a given \(r\)-factor
- A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS
- Some results about component factors in graphs
- Stability number and minimum degree for (\(a, b, k\))-critical graphs
- Degree conditions for graphs to have \([a,b]\)-factors excluding a given \(k\)-factors
This page was built for publication: Binding numbers and \([a,b]\)-factors excluding a given \(k\)-factor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q643606)
