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

DOI10.1016/J.CRMA.2011.08.007MaRDI QIDQ643606zbMATHOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• Binding number and Hamiltonian \((g,f)\)-factors in graphs
• Degree conditions for graphs to have \([a,b]\)-factors excluding a given \(k\)-factors
• Fan-type results for the existence of [\(a\),\(b\)]-factors
• Graph theory with applications
• Independence number, connectivity and \((a,b,k)\)-critical graphs
• 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
• The existence of \(k\)-factors in squares of graphs
• Toughness and \((a,b,k)\)-critical graphs

Cited in

(11)

• On all fractional \({(a,b,k)}\)-critical graphs
• Binding numbers of graphs and the existence of \([a,b]\)-factors
• A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b]-FACTOR-CRITICAL GRAPHS
• Neighbourhood conditions for fractional ID-\([a,b]\)-factor-critical graphs
• Some results about component factors in graphs
• Degree conditions for graphs to have \([a,b]\)-factors excluding a given \(k\)-factors
• A sufficient condition for the existence of a \(k\)-factor excluding a given \(r\)-factor
• Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs
• Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs
• scientific article; zbMATH DE number 844163 (Why is no real title available?)
• Stability number and minimum degree for (\(a, b, k\))-critical graphs

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)