2016/06/23 by Jisu Jeong, Jeong, Jisu, Seongmin Ok +3
Computer Science · Mathematics · #05C75 #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph theory and applications #Interconnection Networks and Systems
paper · pdf · doi:10.48550/arxiv.1606.07157
openalex publication_date 2016/06/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.