共 50 条
Recognizing pinch-graphic matroids
被引:0
|作者:
Bertrand Guenin
Cheolwon Heo
机构:
[1] University of Waterloo,
[2] Korea Institute for Advanced Study (KIAS),undefined
来源:
关键词:
Binary matroids;
Even-cycle matroids;
Signed-graphs;
Algorithms;
Complexity;
Primary 05C22;
05C85;
05B35;
Secondary 90C27;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
Even-cycle matroids are elementary lifts of graphic matroids. An even-cycle matroid is pinch-graphic if it has a signed-graph representation with a blocking pair. We present a polynomial algorithm to check if an internally 4-connected binary matroid is pinch-graphic. Combining this with a result in Guenin and Heo (Small separations in pinch-graphic matroids. Math Program (2023). https://doi.org/10.1007/s10107-023-01950-8) this allows us to check, in polynomial time, if an arbitrary binary matroid is pinch-graphic.
引用
收藏
页码:113 / 134
页数:21
相关论文