5 papers
Laminar Tight Cuts in Matching Covered Graphs
Guantao Chen, Xing Feng, Fuliang Lu +2
An edge cut of a graph is {\it tight} if for every perfect matching of .~Barrier cuts and 2-separation cuts are called {\it ELP-cuts}, which are two i…
-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…
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…
Average degrees of edge-chromatic critical graphs
Yan Cao, Guantao Chen, Suyun Jiang +2
Given a graph , denote by , and the maximum degree, the average degree and the chromatic index of , respectively. A simple graph is called {\it ed…
The smallest one-realization of a given set
Ping Zhao, Kefeng Diao, Kaishun Wang
In [The smallest one-realization of a given set, Electronic J. Combin. 19 (2012), P19], we determined the minimum number of vertices of one-realizations of a given finite s…