Frame Matroids and Biased Graphs
Frame Matroids and Biased Graphs
复制标题
框架阵和有偏图
DOI:
10.1006/eujc.1994.1034
复制
发表时间:
1994
期刊:
影响因子:
--
通讯作者:
T. Zaslavsky
中科院分区:
文献类型:
--
作者:
T. Zaslavsky
Abstract A frame matroid is any submatroid of a matroid in which each point belongs to a line spanned by a fixed basis. A biased graph is a graph with certain polygons called balanced, no theta graph containing exactly two balanced polygons. We prove that certain matroids, called bias matroids, of biased graphs are identical to the finitary frame matroids. As an application we deduce two simple characterizations of frame matroids and some facts about planar forbidden minors for bias matroids.