Characterizing graphs of maximum matching width at most 2
Jisu Jeong, Seongmin Ok, Geewon Suh
TL;DR
This paper characterizes graphs with maximum matching width at most 2 using minor obstructions and computes the exact maximum matching width of a grid, advancing understanding of this graph parameter.
Contribution
It provides a characterization of graphs with maximum matching width at most 2 via minor obstructions and calculates the maximum matching width for grid graphs.
Findings
Characterization of graphs with maximum matching width ≤ 2
Exact maximum matching width of grid graphs
Identification of minor obstructions for this class
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph theory and applications · Interconnection Networks and Systems