×

zbMATH — the first resource for mathematics

Separating cocircuits in binary matroids. (English) Zbl 0487.05015

MSC:
05B35 Combinatorial aspects of matroids and geometric lattices
68W99 Algorithms in computer science
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] R.E. Bixby, Bridges in general matroids, to appear.
[2] Bixby, R.E.; Cunningham, W.H., Matroids, graphs, and 3-connectivity, (), 91-103
[3] Bixby, R.E.; Cunningham, W.H., Converting linear programs to network problems, Math. oper. res., 5, 321-357, (1980) · Zbl 0442.90095
[4] Cunningham, W.H., Chords and disjoint paths in matroids, Discrete math., 19, 7-15, (1977) · Zbl 0366.05021
[5] Cunningham, W.H.; Edmonds, J., A combinatorial decomposition theory, Canad. J. math., 32, 734-765, (1980) · Zbl 0442.05054
[6] Hansen, S., A generalization of a theorem of Sylvester on the lines determined by a finite point set, Math. scand., 16, 175-180, (1965) · Zbl 0156.19501
[7] Seymour, P.D., Decomposition of regular matroids, J. combin. theory ser. B, 28, 305-359, (1980) · Zbl 0443.05027
[8] Seymour, P.D., Recognizing graphic matroids, Combinatorica, 1, 75-78, (1981) · Zbl 0501.05022
[9] Tamari, R., Combinatorial algorithms in certain classes of binary matroids, ()
[10] Tutte, W.T., An algorithm for determining whether a given binary matroid is graphic, Proc. amer. math. soc., 11, 905-917, (1960) · Zbl 0097.38905
[11] Tutte, W.T., From matrices to graphs, Canad. J. math., 16, 108-127, (1964) · Zbl 0138.19202
[12] Tutte, W.T., Lectures on matroids, J. res. nat. bur. standards sect. B, 69, 1-47, (1965) · Zbl 0151.33801
[13] Tutte, W.T., On even matroids, J. res. nat. bur. standards sect. B, 71, 213-214, (1967) · Zbl 0165.26801
[14] Welsh, D.J.A., Matroid theory, (1976), Academic New York · Zbl 0343.05002
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.