Binding number and Hamiltonian \((g,f)\)-factors in graphs
From MaRDI portal
Publication:2471346
DOI10.1007/BF02832363zbMath1133.05074MaRDI QIDQ2471346
Publication date: 22 February 2008
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (3)
Binding numbers and \([a,b\)-factors excluding a given \(k\)-factor] ⋮ An existence theorem on Hamiltonian (g,f)-factors in networks ⋮ Degree and stability number condition for the existence of connected factors in graphs
Cites Work
This page was built for publication: Binding number and Hamiltonian \((g,f)\)-factors in graphs