Characterizing graphs of maximum matching width at most 2
classification
🧮 math.CO
cs.DM
keywords
matchingmaximumwidthgraphgraphsbipartitebranch-decompositioncharacterize
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.