Binding numbers and \(f\)-factors of graphs

DOI10.1016/0095-8956(92)90053-ZzbMath0772.05080MaRDI QIDQ1193563

Mikio Kano, Norihide Tokushige

Publication date: 27 September 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

minimum degreeconnected graph\(f\)-factorbinding number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (17)

Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ Sufficient conditions for a graph to have all \([a, b\)-factors and \((a, b)\)-parity factors] ⋮ A characterization of graphs having all \((g,f)\)-factors ⋮ Path factors in subgraphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Some results about ID-path-factor critical graphs ⋮ Binding number and path-factor critical deleted graphs ⋮ Binding number, \(k\)-factor and spectral radius of graphs ⋮ Exact values for some unbalanced Zarankiewicz numbers ⋮ Best monotone degree conditions for binding number ⋮ Research on fractional critical covered graphs ⋮ Simplified existence theorems on all fractional \([a,b\)-factors] ⋮ An Ore-type condition for the existence of \(k\)-factors in graphs ⋮ Binding numbers and restricted fractional \(( g , f )\)-factors in graphs ⋮ Binding number and Hamiltonian \((g,f)\)-factors in graphs ⋮ Unnamed Item ⋮ Some results about component factors in graphs

Cites Work

• Minimum degree of a graph and the existence of k-factors
• A sufficient condition for a graph to have \([a,b\)-factors]
• Perfect matchings of a graph
• Binding number and minimum degree for k-factors
• BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
• Two sufficient conditions for a 2-factor in a bipartite graph
• k -Factors and Neighbourhoods of Independent Sets in Graphs
• Sufficient conditions for matchings
• The binding number of a graph and its Anderson number
• A sufficient condition for a bipartite graph to have a k‐factor
• The Factors of Graphs
• A Short Proof of the Factor Theorem for Finite Graphs

This page was built for publication: Binding numbers and \(f\)-factors of graphs