This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L.W. Beineke, Decompositions of complete graphs into forests, Magyar Tud. Akad. Mat. Kutato Int. Közl. 9 (1964), 589–594.
P. Hall, On representatives of subsets, J. London Math. Soc. 10 (1935), 26–30.
J. Edmonds, Minimum partition of a matroid into independent subsets, J. Res. Nat. Bur, Stand. 69B (1965), 67–72.
J. Edmonds, Lehman's switching game and a theorem of Tutte and Nash-Williams, J. Res. Nat. Bur. Stand. 69B (1965), 73–77.
F. Harary, Graph Theory, Addison-Wesley, Reading, 1969.
F. Harary and G.E. Uhlenbeck, On the number of Husimi trees, I. Proc. Nat. Acad. Sci., USA 39 (1953), 315–322.
A.J. Hoffman and H.W. Kuhn, On systems of distinct representatives, Linear Inequalities and Related Systems (Annals of Math. Stud. 38, Princeton), (1956), 199–206.
A.J. Hoffman and H.W. Kuhn, Systems of distinct representatives and linear programming, Amer. Math. Monthly 63 (1956), 455–460.
A. Lehman, A solution of the Shannon switching game, J. Soc. Indust. Appl. Math. 12 (1964), 687–725.
S. MacLane, A combinatorial condition for planar graphs, Fund. Math. 28 (1937), 22–32.
G.J. Minty, On the axiomatic foundations of the theories of directed linear graphs, electrical networks and network programming, J. Math. Mech. 15 (1966), 485–520.
L. Mirsky and H. Perfect, Applications of the notion of independence to problems of combinatorial analysis, J. Combinatorial Theory 2 (1967), 327–357.
C.St.J.A. Nash-Williams, On applications of matroids to graph theory, Theory of Graphs International Symposium Rome, Dunod, 1968, 263–265.
C.St.J.A. Nash-Williams, Edge disjoint spanning trees of finite graphs, J. London Math. Soc. 36 (1961), 445–450.
R. Rado, A theorem on independence relations, Quart. J. Math. Oxford 13 (1942), 83–89.
R. Rado, Note on independence functions, Proc. Lond. Math. Soc. 7 (1957), 300–320.
R. Rado, Abstract linear dependence, Colloq. Math. 14 (1966), 257–264.
G.C. Rota, On the foundations of combinatorial theory, I: Theory of Möbius functions, Zeit. Wahrschein. 2 (1964), 340–368.
W.T. Tutte, Lectures on matroids, J. Res. Nat. Bur. Stand. 69B (1965), 1–48.
W.T. Tutte, On the problem of decomposing a graph into n-connected factors, J. Lond. Math. Soc. 36 (1961), 221–230.
D.J.A. Welsh, Matroids and their Applications, Seminar Notes, Univ. of Michigan (to appear).
D.J.A. Welsh, Euler and bipartite matroids, J. Combinatorial Theory (to appear).
D.J.A. Welsh, On the hyperplanes of a matroid, Proc. Camb. Phil. Soc. (to appear).
D.J.A. Welsh, Applications of a theorem by Rado, Mathematika (to appear).
H. Whitney, On the abstract properties of linear dependence, Amer. J. Math. 57 (1935), 509–533.
H. Whitney, 2-isomorphic graphs, Amer. J. Math. 55 (1933), 245–254.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1969 Springer-Verlag
About this paper
Cite this paper
Harary, F., Welsh, D. (1969). Matroids versus graphs. In: Chartrand, G., Kapoor, S.F. (eds) The Many Facets of Graph Theory. Lecture Notes in Mathematics, vol 110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0060114
Download citation
DOI: https://doi.org/10.1007/BFb0060114
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04629-5
Online ISBN: 978-3-540-36161-9
eBook Packages: Springer Book Archive