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

zbMATH Open1177.05097MaRDI QIDQ950655FDOQ950655

Authors: Yang Xu, Sizhong Zhou 

Publication date: 3 November 2008

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

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

zbMATH Keywords

graphsubgraph\((g,f)\)-factor

Mathematics Subject Classification ID

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

Cited In (7)

• Partial parity \((g,f)\)-factors and subgraphs covering given vertex subsets
• Sufficient conditions for graphs with {P₂, P₅}-factors
• Some remarks about factors of graphs
• More sufficient conditions for a graph to have factors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some sufficient conditions for graphs to have (g, f)-factors

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)