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

zbMATH Open1177.05097MaRDI QIDQ950655FDOQ950655

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

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

Mathematics Subject Classification ID

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

Cited In (5)

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

   Recommendations

• Some sufficient conditions for graphs to have (g, f)-factors 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• \( (g,f)\)-factors of graphs with prescribed properties 👍 👎
• Title not available (Why is that?) 👍 👎

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)