Binding number and Hamiltonian \((g,f)\)-factors in graphs

DOI10.1007/BF02832363zbMath1133.05074MaRDI QIDQ2471346

Gui Zhen Liu, Jian-Sheng Cai

Publication date: 22 February 2008

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cycle

Mathematics Subject Classification ID

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

• Unnamed Item
• Unnamed Item
• Binding numbers and \(f\)-factors of graphs
• Structural properties for certain classes of infinite planar graphs
• On oriented 2-factorable graphs
• Connected factors in graphs -- a survey
• Subgraphs with prescribed valencies
• The binding number of a graph and its Anderson number

This page was built for publication: Binding number and Hamiltonian \((g,f)\)-factors in graphs