Matching connectivity: on the structure of graphs with perfect matchings

DOI10.1016/j.endm.2017.06.080zbMath1378.05167arXiv1704.00493OpenAlexW2605002839MaRDI QIDQ1689965

Archontia C. Giannopoulou, Sebastian Wiederrecht, Stephan Kreutzer

Publication date: 18 January 2018

Full work available at URL: https://arxiv.org/abs/1704.00493

zbMATH Keywords

connectivityextendabilitymatchingsbracesMenger-type results

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Brick decompositions and the matching rank of graphs
• Matching structure and the matching lattice
• On n-extendable graphs
• Matchings in regular graphs
• Extending matchings in graphs: A survey
• Permanents, Pfaffian orientations, and even directed circuits
• Recent Progress in Matching Extension
• An Excluded Grid Theorem for Digraphs with Forbidden Minors
• The Factorization of Linear Graphs

This page was built for publication: Matching connectivity: on the structure of graphs with perfect matchings