×

The Euler circuit theorem for binary matroids. (English) Zbl 0321.05026


MSC:

05B35 Combinatorial aspects of matroids and geometric lattices
05C35 Extremal problems in graph theory
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Edmonds, J., Submodular functions, matroids and certain polyhedra, (“Combinatorial Structures and Applications,” Proc. Calgary Internat. Conf.. “Combinatorial Structures and Applications,” Proc. Calgary Internat. Conf., 1969 (1970), Gordon and Breach: Gordon and Breach New York), 69-87 · Zbl 0268.05019
[2] Nash-Williams, C. St. J.A, An application of matroids to graph theory, (“Theory of Graphs,” International Symposium. “Theory of Graphs,” International Symposium, Rome, July, 1966 (1967), Dunod: Dunod Paris), 263-265 · Zbl 0188.55903
[3] Welsh, D. J.A, Euler and bipartite matroids, J. Combinatorial Theory, 4, 375-377 (1969) · Zbl 0169.01901
[4] Tutte, W. T., Lectures on matroids, J. Res. Nat. Bur. Standards, 69B1, 1-47 (1965) · Zbl 0151.33801
[5] Minty, G. J., On the axiomatic foundations of the theories of directed linear graphs, electrical networks and network-programming, J. Math. Mech., 15, 485-520 (1966) · Zbl 0141.21601
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.