The cubic vertices of solid minimal bricks
From MaRDI portal
Publication:6184524
DOI10.1016/j.disc.2023.113746MaRDI QIDQ6184524
Publication date: 25 January 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Cites Work
- Unnamed Item
- The perfect matching polytope and solid bricks
- Brick decompositions and the matching rank of graphs
- Matching structure and the matching lattice
- On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
- A generalization of Little's theorem on Pfaffian orientations
- How to build a brick
- Minimal bricks have many vertices of small degree
- Minimal bricks
- On Two Unsolved Problems Concerning Matching Covered Graphs
- The Cubic Vertices of Minimal Bricks
This page was built for publication: The cubic vertices of solid minimal bricks