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

zbMATH Open1289.05393MaRDI QIDQ2864459FDOQ2864459

Authors: Bing-Yuan Pu, Sizhong Zhou 

Publication date: 6 December 2013

Published in: Ars Combinatoria (Search for Journal in Brave)

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

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)

Cited In (11)

• Note on connected \((g, f)\)-factors of graphs
• Binding number, minimum degree and \((g,f)\)-factors of graphs
• A degree condition for graphs to have connected \((g,f)\)-factors
• Title not available (Why is that?)
• A new sufficient condition for graphs to have \((g,f)\)-factors.
• Title not available (Why is that?)
• A neighborhood condition for graphs to have \((g,f)\)-factors.
• Title not available (Why is that?)
• A degree condition for graphs to have Hamiltonian \((g,f)\)-factors
• Some sufficient conditions for graphs to have (g, f)-factors
• Title not available (Why is that?)

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)