Every wheel-like brick lies in a recursively defined family obtained by splicing odd wheels, and every minimal matching covered graph has minimum degree 2 or 3.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Wheel-like bricks and minimal matching covered graphs
Every wheel-like brick lies in a recursively defined family obtained by splicing odd wheels, and every minimal matching covered graph has minimum degree 2 or 3.