Paper Info
Title
The biased graphs whose matroids are binary
Abstract
A biased graph Φ consists of a graph and a class of distinguished polygons such that no theta subgraph contains exactly two distinguished polygons. There are three matroids naturally associated with Φ: the bias matroid G ( Φ ), the lift matroid L ( Φ ), and the complete lift L 0 ( Φ ). We characterize those Φ for which any of these matroids is binary.
Year
DOI
Venue
1987
10.1016/0095-8956(87)90051-7
J. Comb. Theory, Ser. B
Field
DocType
Volume
Graph theory,Matroid,Discrete mathematics,Polygon,Combinatorics,Matroid partitioning,Biased graph,Dual graph,Graphic matroid,Mathematics,Branch-decomposition
Journal
42
Issue
ISSN
Citations 
3
Journal of Combinatorial Theory, Series B
7
PageRank 
References 
Authors
1.86
1
1
Name
Order
Citations
PageRank
T. Zaslavsky129756.67