Showing 2019Show all
2 papers · 1 filter
math.CO2019
-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks
Fuliang Lu, Xing Feng, Yan Wang
A {\em brick} is a non-bipartite matching covered graph without non-trivial tight cuts. Bricks are building blocks of matching covered graphs. We say that an edge in a brick $G…
math.CO2019
Equivalence classes in matching covered graphs
Fuliang Lu, Nishad Kothari, Xing Feng +1
A connected graph , of order two or more, is matching covered if each edge lies in some \pema. The tight cut decomposition of a matching covered graph yields a list of brick…