Every simple nonsolid brick in which every removable edge is solitary decomposes recursively by splicing odd wheels, and this decomposition cannot use K4 as the wheel factor.
Bricks in which every vertex is incident with a forcing edge
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
An edge of a matching covered graph G is a forcing edge if it lies in precisely one perfect matching of G. A matching covered graph is a brick if and only if it is 3-connected and bicritical (the deletion of each pair of distinct vertices results in a graph with a perfect matching). In this paper, we prove that every vertex of a brick is incident with a forcing edge if and only if the brick is an odd wheel up to multiple edges.
fields
math.CO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Bricks that every removable edge is solitary
Every simple nonsolid brick in which every removable edge is solitary decomposes recursively by splicing odd wheels, and this decomposition cannot use K4 as the wheel factor.