Braces of Perfect Matching Width 2

TL;DR

This paper explores the structural properties of perfect matching width in graphs, establishing key relationships with matching minors and providing characterizations and recognition algorithms for certain graph classes.

Contribution

It introduces foundational results linking perfect matching width with matching minors and characterizes braces of width two, including a polynomial recognition method.

Findings

Established tight connections between perfect matching width and matching minors.

Proved that perfect matching width is nearly monotone under matching minors.

Provided characterizations and a polynomial-time recognition algorithm for braces of width two.

Abstract

Perfect matching width is a treewidth-like parameter designed for graphs with perfect matchings. The concept was originally introduced by Norine for the study of non-bipartite Pfaffian graphs. Additionally, perfect matching width appears to be a useful structural tool for investigating matching minors, a specialised version of minors related to perfect matchings. In this paper we lay the groundwork for understanding the interaction of perfect matching width and matching minors by establishing tight connections between the perfect matching width of any matching covered graph $G$ and the perfect matching width of its bricks and braces (a matching theoretic version of blocks) and proving that perfect matching width is almost monotone under the matching minor relation. As an application, we give several characterisations for braces of perfect matching width two, including one that allows for a polynomial time recognition algorithm.