Note on connected (g, f)-factors of graphs

zbMATH Open1294.05131MaRDI QIDQ5401017FDOQ5401017

Authors: Quanru Pan, Sizhong Zhou, Jiancheng Wu 

Publication date: 12 March 2014

Recommendations

• A degree condition for graphs to have connected \((g,f)\)-factors
• A new sufficient condition for graphs to have \((g,f)\)-factors.
• A degree condition for graphs to have \((g,f)\)-factors.
• Connected \([a,b]\)-factors in graphs
• Connected \((g,f)\)-factors

zbMATH Keywords

minimum degree\((g, f)\)-factorgraph orderconnected \((g, f)\)-factor

Mathematics Subject Classification ID

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

Cited In (5)

• A degree condition for graphs to have connected \((g,f)\)-factors
• Factors and connected induced subgraphs
• Connected \([a,b]\)-factors in graphs
• Title not available (Why is that?)
• A note on f-factors in directed and undirected multigraphs

This page was built for publication: Note on connected \((g, f)\)-factors of graphs

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