Integer \(k\)-matchings of graphs

DOI10.1016/j.dam.2017.08.013zbMath1375.05218OpenAlexW2765238962MaRDI QIDQ1682886

Yan Liu, Xiao Hui Liu

Publication date: 6 December 2017

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

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

zbMATH Keywords

fractional matching number\(k\)-matchingfractional matching\(k\)-matching number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

Fractional Gallai-Edmonds decomposition and maximal graphs on fractional matching number ⋮ Nordhaus-Gaddum type inequality for the integer \(k\)-matching number of a graph ⋮ Integer \(k\)-matching preclusion of some interconnection networks ⋮ Integer \(k\)-matchings of graphs: \(k\)-Berge-Tutte formula, \(k\)-factor-critical graphs and \(k\)-barriers ⋮ Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Spectral radius and fractional matchings in graphs
• The difference and ratio of the fractional matching number and the matching number of graphs
• Fractional matchings and the Edmonds-Gallai theorem
• Sharp lower bounds on the fractional matching number
• On perfect \(k\)-matchings
• The fractional matching numbers of graphs

This page was built for publication: Integer \(k\)-matchings of graphs