Binding numbers and \([a,b]\)-factors excluding a given \(k\)-factor

DOI10.1016/j.crma.2011.08.007zbMath1283.05229OpenAlexW2012299089MaRDI QIDQ643606

Si-zhong 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

Mathematics Subject Classification ID

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

Related Items

A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b-FACTOR-CRITICAL GRAPHS], On all fractional \({(a,b,k)}\)-critical graphs, Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs, Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs, Some results about component factors in graphs, STABILITY NUMBER AND MINIMUM DEGREE FOR (a, b, k)-CRITICAL GRAPHS, Neighbourhood conditions for fractional ID-[a, b-factor-critical graphs]

Cites Work

• Unnamed Item
• Unnamed Item
• The existence of \(k\)-factors in squares of graphs
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• Toughness and \((a,b,k)\)-critical graphs
• Binding number and Hamiltonian \((g,f)\)-factors in graphs
• Fan-type results for the existence of [\(a\),\(b\)-factors]
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• Notes on the binding numbers for (a, b, k)-critical graphs
• Subgraphs with prescribed valencies
• The binding number of a graph and its Anderson number