Papers
Topics
Authors
Recent
Search
2000 character limit reached

Characterizing graphs of maximum matching width at most 2

Published 23 Jun 2016 in math.CO and cs.DM | (1606.07157v1)

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.

Citations (2)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (3)

  1. Jisu Jeong 
  2. Seongmin Ok 
  3. Geewon Suh 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up