Corpus ID: 62841500

Braces of Perfect Matching Width 2

@article{Giannopoulou2019BracesOP,
  title={Braces of Perfect Matching Width 2},
  author={Archontia C. Giannopoulou and Meike Hatzel and S. Wiederrecht},
  journal={ArXiv},
  year={2019},
  volume={abs/1902.06307}
}

Archontia C. Giannopoulou, Meike Hatzel, S. Wiederrecht

Published 2019

Mathematics, Computer Science

ArXiv

A graph G is called matching covered if it is connected and every edge is contained in a perfect matching. Perfect matching width is a width parameter for matching covered graphs based on a branch decomposition that can be considered a generalisation of directed treewidth. We show that the perfect matching width of every bipartite matching covered graph is within a factor of 2 of the perfect matching width of its braces. Moreover, we give characterisations for braces of perfect matching width… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed