an:06937766
Zbl 1395.05133
Jeong, Jisu; Ok, Seongmin; Suh, Geewon
Characterizing graphs of maximum matching width at most 2
EN
Discrete Appl. Math. 248, 102-113 (2018).
00414462
2018
j
05C70 05C35
maximum matching width; minor obstructions; grid
Summary: The maximum matching width is a width-parameter that is defined on a branch-decomposition over the vertex set of a graph. The size of a maximum matching in the bipartite graph is used as a cut-function. In this paper, we characterize the graphs of maximum matching width at most \(2\) using the minor obstruction set. Also, we compute the exact value of the maximum matching width of a grid.