More sufficient conditions for a graph to have (g,f)-factors

MaRDI QIDQ950655zbMATH OpenFDO

Authors Yang Xu, Sizhong Zhou

Publication date 3 November 2008

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

\((g,f)\)-factorgraphsubgraph

Mathematics Subject Classification ID

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

Recommendations

• Some sufficient conditions for graphs to have (g, f)-factors
• scientific article; zbMATH DE number 1287820
• scientific article; zbMATH DE number 700639
• (g,f)-factors of graphs with prescribed properties
• scientific article; zbMATH DE number 817532

Cited in

(8)

• More sufficient conditions for a graph to have factors
• Sufficient conditions for graphs to have (g,f)-factors
• scientific article; zbMATH DE number 3869380 (Why is no real title available?)
• scientific article; zbMATH DE number 1159863 (Why is no real title available?)
• Sufficient conditions for graphs with {P₂, P₅}-factors
• Some sufficient conditions for graphs to have (g, f)-factors
• Some remarks about factors of graphs
• Partial parity (g,f)-factors and subgraphs covering given vertex subsets

This page was built for publication: More sufficient conditions for a graph to have \((g,f)\)-factors

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