Integer \(k\)-matchings of graphs: \(k\)-Berge-Tutte formula, \(k\)-factor-critical graphs and \(k\)-barriers

DOI10.1016/j.dam.2021.03.005zbMath1462.05303OpenAlexW3145187392MaRDI QIDQ2022517

Danni Xiong, Yan Liu, Xueli Su

Publication date: 29 April 2021

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

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

zbMATH Keywords

\(k\)-factor-critical\(k\)-barrier\(k\)-Berge-Tutte formulainteger \(k\)-matching

Mathematics Subject Classification ID

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

Related Items (3)

Nordhaus-Gaddum type inequality for the integer \(k\)-matching number of a graph ⋮ Integer \(k\)-matching preclusion of some interconnection networks ⋮ Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs

Cites Work

• Integer \(k\)-matchings of graphs
• On perfect \(k\)-matchings
• Tutte sets in graphs I: Maximal tutte sets and D-graphs
• The Factorization of Linear Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Integer \(k\)-matchings of graphs: \(k\)-Berge-Tutte formula, \(k\)-factor-critical graphs and \(k\)-barriers