Braces of Perfect Matching Width 2
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2019
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911769243418624 |
|---|---|
| author | Giannopoulou, Archontia C. Hatzel, Meike Wiederrecht, Sebastian |
| author_facet | Giannopoulou, Archontia C. Hatzel, Meike Wiederrecht, Sebastian |
| contents | Perfect matching width is a treewidth-like parameter designed for graphs with perfect matchings. The concept was originally introduced by Norine for the study of non-bipartite Pfaffian graphs. Additionally, perfect matching width appears to be a useful structural tool for investigating matching minors, a specialised version of minors related to perfect matchings. In this paper we lay the groundwork for understanding the interaction of perfect matching width and matching minors by establishing tight connections between the perfect matching width of any matching covered graph $G$ and the perfect matching width of its bricks and braces (a matching theoretic version of blocks) and proving that perfect matching width is almost monotone under the matching minor relation. As an application, we give several characterisations for braces of perfect matching width two, including one that allows for a polynomial time recognition algorithm. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1902_06307 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Braces of Perfect Matching Width 2 Giannopoulou, Archontia C. Hatzel, Meike Wiederrecht, Sebastian Combinatorics Discrete Mathematics 05C83, 05C75 Perfect matching width is a treewidth-like parameter designed for graphs with perfect matchings. The concept was originally introduced by Norine for the study of non-bipartite Pfaffian graphs. Additionally, perfect matching width appears to be a useful structural tool for investigating matching minors, a specialised version of minors related to perfect matchings. In this paper we lay the groundwork for understanding the interaction of perfect matching width and matching minors by establishing tight connections between the perfect matching width of any matching covered graph $G$ and the perfect matching width of its bricks and braces (a matching theoretic version of blocks) and proving that perfect matching width is almost monotone under the matching minor relation. As an application, we give several characterisations for braces of perfect matching width two, including one that allows for a polynomial time recognition algorithm. |
| title | Braces of Perfect Matching Width 2 |
| topic | Combinatorics Discrete Mathematics 05C83, 05C75 |
| url | https://arxiv.org/abs/1902.06307 |