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

DOI10.1080/00207160701524368MaRDI QIDQ3526044zbMATH OpenOpenAlexFDO

Authors Jiansheng Cai, Guizhen Liu, Jianfeng Hou

Publication date 24 September 2008

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160701524368

zbMATH Keywords

\((g, f)\)-factorbinding numbercomputer scienceHamiltonian \((g, f)\)-factor

Mathematics Subject Classification ID

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

Recommendations

• Binding number and Hamiltonian (g,f)-factors in graphs
• Binding number, minimum degree for connected (g, f + 1)-factors in graphs
• An existence theorem on Hamiltonian (g,f)-factors in networks
• Binding number, minimum degree and \((g,f)\)-factors of graphs
• Binding numbers and f-factors of graphs

Cites work

• Graph theory with applications
• Minimum degree of a graph and the existence of k-factors
• Perfect matchings of a graph
• Some Theorems on Abstract Graphs
• Subgraphs with prescribed valencies
• The binding number of a graph and its Anderson number

Cited in

(5)

• Binding number and Hamiltonian (g,f)-factors in graphs
• scientific article; zbMATH DE number 1792587 (Why is no real title available?)
• A sufficient condition for the existence of a k-factor excluding a given r-factor
• An existence theorem on Hamiltonian (g,f)-factors in networks
• Binding number, minimum degree for connected (g, f + 1)-factors in graphs

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

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