scientific article; zbMATH DE number 817532

MaRDI QIDQ4854903zbMATH OpenFDO

Authors Guiying Yan

Publication date 31 March 1996

zbMATH Keywords

\((f, g)\)-graph\((f,g)\)-factormatchingspanning subgraph

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 798653
• scientific article; zbMATH DE number 700639
• scientific article; zbMATH DE number 5137395
• scientific article; zbMATH DE number 1895634

Cited in

(20)

• A note on polynomials and \(f\)-factors of graphs
• Greedily constructing maximal partial f-factors
• Maximum \((g,f)\)-factors of a general graph
• \(f\)-optimal factors of infinite graphs
• A characterization of graphs having all (g,f)-factors
• Connected factors and spanning trees in graphs
• Complete factors and \(f\)-factors
• Simplified existence theorems for \((g,f)\)-factors
• On the complexity of all ( g , f )-factors problem
• (0,f)-factors with some properties in (0,mf-1)-graphs
• Connected (g,f)-factors
• A Note on the Existence of All (g,f)-Factors
• scientific article; zbMATH DE number 4127264 (Why is no real title available?)
• scientific article; zbMATH DE number 1559134 (Why is no real title available?)
• scientific article; zbMATH DE number 4116582 (Why is no real title available?)
• scientific article; zbMATH DE number 1895634 (Why is no real title available?)
• scientific article; zbMATH DE number 798653 (Why is no real title available?)
• scientific article; zbMATH DE number 1439462 (Why is no real title available?)
• Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors
• More sufficient conditions for a graph to have \((g,f)\)-factors

This page was built for publication:

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