Characterizing graphs of maximum matching width at most 2
Combinatorics
2016-06-24 v1 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1606.07157,
title = {Characterizing graphs of maximum matching width at most 2},
author = {Jisu Jeong and Seongmin Ok and Geewon Suh},
journal= {arXiv preprint arXiv:1606.07157},
year = {2016}
}