Maximum fractional factors in graphs

DOI10.1016/j.aml.2007.02.004zbMath1132.05049OpenAlexW2000356104MaRDI QIDQ2472791

Qinglin Yu, Lanju Zhang, Gui Zhen Liu

Publication date: 25 February 2008

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

Full work available at URL: https://doi.org/10.1016/j.aml.2007.02.004

zbMATH Keywords

1-factortoughnessfractional \(k\)-factorconnected fractional factorincreasing walk

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (6)

Stability Number and k-Hamiltonian [a, b-factors] ⋮ On all fractional \({(a,b,k)}\)-critical graphs ⋮ Independence number and minimum degree for fractional ID-\(k\)-factor-critical graphs ⋮ Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs ⋮ Remarks on fractional ID-\(k\)-factor-critical graphs ⋮ Degree conditions for fractional \((a,b,k)\)-critical covered graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Maximum \((g,f)\)-factors of a general graph
• Connected \([k,k+1\)-factors of graphs]
• Tough graphs and Hamiltonian circuits.
• TWO THEOREMS IN GRAPH THEORY
• Toughness and the existence ofk-factors

This page was built for publication: Maximum fractional factors in graphs