167 citations
- Gannan Normal UniversityCN15 papers
- China Academy of Engineering PhysicsCN13 papers
- South China Normal UniversityCN12 papers
- Nanjing UniversityCN11 papers
- Collaborative Innovation Center of Advanced MicrostructuresCN10 papers
- Chinese Academy of SciencesCN8 papers
- Peking UniversityCN7 papers
- Institute of PhysicsPL5 papers
- Hunan Normal UniversityCN4 papers
- Institute of Fluid Physics4 papers
- Nanjing University of Information Science and TechnologyCN4 papers
- Central South UniversityCN3 papers
Showing math.COShow all
2 papers · 1 filter
math.CO2020
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…
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…