Maximum \((g,f)\)-factors of a general graph

DOI10.1016/0012-365X(91)90158-XzbMath0758.05075MaRDI QIDQ1179272

William Y. C. Chen

Publication date: 26 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

maximum \((g,f)\)-factorsminimum \((g,f)\)-factors

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Characterizations of maximum fractional \((g,f)\)-factors of graphs ⋮ Maximum fractional factors in graphs

Cites Work

• Alternating Eulerian trails with prescribed degrees in two edge-colored complete graphs
• TWO THEOREMS IN GRAPH THEORY
• Factors and factorizations of graphs—a survey
• Subgraphs with prescribed valencies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximum \((g,f)\)-factors of a general graph