A degree condition for graphs to have (g,f)-factors.

MaRDI QIDQ2864459zbMATH OpenFDO

Authors Bing-Yuan Pu, Sizhong Zhou

Publication date 6 December 2013

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

degree condition\((g,f)\)-factorgraph factor

Mathematics Subject Classification ID

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

Recommendations

• A new sufficient condition for graphs to have \((g,f)\)-factors.
• A neighborhood condition for graphs to have \((g,f)\)-factors.
• A degree condition for graphs to have connected \((g,f)\)-factors
• A degree condition for graphs to have Hamiltonian \((g,f)\)-factors
• Binding number, minimum degree and \((g,f)\)-factors of graphs

Cited in

(11)

• Some sufficient conditions for graphs to have (g, f)-factors
• scientific article; zbMATH DE number 2188394 (Why is no real title available?)
• Note on connected (g, f)-factors of graphs
• A degree condition for graphs to have connected \((g,f)\)-factors
• Binding number, minimum degree and \((g,f)\)-factors of graphs
• scientific article; zbMATH DE number 734469 (Why is no real title available?)
• A new sufficient condition for graphs to have \((g,f)\)-factors.
• scientific article; zbMATH DE number 1467781 (Why is no real title available?)
• A neighborhood condition for graphs to have \((g,f)\)-factors.
• scientific article; zbMATH DE number 1894980 (Why is no real title available?)
• A degree condition for graphs to have Hamiltonian \((g,f)\)-factors

This page was built for publication: A degree condition for graphs to have \((g,f)\)-factors.

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