The fractional matching numbers of graphs

DOI10.1002/net.10047zbMath1016.05060OpenAlexW1964210575MaRDI QIDQ4798195

Yan Liu, Gui Zhen Liu

Publication date: 19 March 2003

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.10047

zbMATH Keywords

fractional matching numberperfect fractional matching

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

Some Results on Fractional Graph Theory ⋮ Hall's and Kőnig's theorem in graphs and hypergraphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ The skiving stock problem and its relation to hypergraph matchings ⋮ Fractional matchings, component-factors and edge-chromatic critical graphs ⋮ Integer \(k\)-matchings of graphs ⋮ Fractional Gallai-Edmonds decomposition and maximal graphs on fractional matching number ⋮ General fractional \(f\)-factor numbers of graphs ⋮ Nordhaus-Gaddum type inequality for the integer \(k\)-matching number of a graph ⋮ A note on maximum fractional matchings of graphs

This page was built for publication: The fractional matching numbers of graphs