Binding number and fractional k-factors of graphs.

zbMATH Open1265.05513MaRDI QIDQ4650004FDOQ4650004

Authors: Zurun Xu, Ziming Duan, Sizhong Zhou 

Publication date: 15 November 2012

Recommendations

• Binding number and minimum degree for the existence of fractional \(k\)-factors with prescribed properties
• scientific article; zbMATH DE number 5041506
• Binding numbers of graphs and existence of fractional factors
• Binding number and minimum degree for fractional \((k,m)\)-deleted graphs
• Binding numbers and fractional \((g,f)\)-deleted graphs

zbMATH Keywords

graphfractional \(k\)-factorbinding number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (8)

• A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs
• A minimum degree condition of fractional \((k,m)\)-deleted graphs
• Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• Title not available (Why is that?)
• Binding numbers for fractional ID-\(k\)-factor-critical graphs
• Binding numbers of graphs and existence of fractional factors
• Binding number and minimum degree for the existence of fractional \(k\)-factors with prescribed properties

This page was built for publication: Binding number and fractional \(k\)-factors of graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650004)