A note on PM-compact K<sub>4</sub>-free bricks
A 3-connected graph is a <i>brick</i> if the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that they are building blocks of the matching covered graphs. Lovász (Combinatorica, 3 (1983), 105-117) showed th...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2022-01-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2022201?viewType=HTML |