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

DOI10.1016/j.dam.2007.10.016zbMath1144.05051OpenAlexW2032745737MaRDI QIDQ947113

Lanju Zhang, Gui Zhen Liu

Publication date: 29 September 2008

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

Full work available at URL: https://doi.org/10.1016/j.dam.2007.10.016

zbMATH Keywords

fractional \((g, f)\)-factorfractional matchingaugmenting chain

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 (4)

A MINIMUM DEGREE CONDITION FOR FRACTIONAL ID-[a,b-FACTOR-CRITICAL GRAPHS] ⋮ Toughness for fractional \((2, b, k)\)-critical covered graphs ⋮ Research on fractional critical covered graphs ⋮ A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fractional matchings and the Edmonds-Gallai theorem
• Maximum \((g,f)\)-factors of a general graph
• Simplified existence theorems for \((g,f)\)-factors
• Properties of fractional \(k\)-factors of graphs
• The Structure and Function of Complex Networks
• Fractional \((g,f)\)-factors of graphs

This page was built for publication: Characterizations of maximum fractional \((g,f)\)-factors of graphs