Binding number and minimum degree for k-factors

DOI10.1002/JGT.3190130511zbMath0693.05052OpenAlexW1982925967MaRDI QIDQ3035330

Norihide Tokushige

Publication date: 1989

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190130511

zbMATH Keywords

minimum degreebinding numberk-factor

Mathematics Subject Classification ID

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

Related Items (6)

Binding Number, Minimum Degree, and Cycle Structure in Graphs ⋮ Minimum degree, independence number and regular factors ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Binding numbers and connected factors ⋮ Binding numbers and \(f\)-factors of graphs ⋮ Unnamed Item

Cites Work

• k -Factors and Neighbourhoods of Independent Sets in Graphs
• The Factors of Graphs

This page was built for publication: Binding number and minimum degree for k-factors