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

    References

    SHOWING 1-10 OF 15 REFERENCES
    Extending matchings in graphs: A survey
    • M. Plummer
    • Mathematics, Computer Science
    • Discret. Math.
    • 1994
    • 98
    A survey of Pfaffian orientations of graphs
    • 56
    • PDF
    Matching structure and the matching lattice
    • L. Lovász
    • Mathematics, Computer Science
    • J. Comb. Theory, Ser. B
    • 1987
    • 142
    New Width Parameters of Graphs
    • 91
    • PDF
    On n-extendable graphs
    • M. Plummer
    • Mathematics, Computer Science
    • Discret. Math.
    • 1980
    • 176
    Are There Any Good Digraph Width Measures?
    • 56
    • PDF
    Thin Edges in Braces
    • 4
    • PDF
    PERMANENTS, PFAFFIAN ORIENTATIONS, AND EVEN DIRECTED CIRCUITS
    • 214
    • PDF
    Even dicycles
    • 10