Matroids versus graphs
- 1 January 1969
- book chapter
- Published by Springer Nature in Lecture Notes in Mathematics
- p. 155-170
- https://doi.org/10.1007/bfb0060114
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Applications of the notion of independence to problems of combinatorial analysisJournal of Combinatorial Theory, 1967
- Lehmans switching game and a theorem of Tutte and Nash-WilliamsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- A Solution of the Shannon Switching GameJournal of the Society for Industrial and Applied Mathematics, 1964
- Edge-Disjoint Spanning Trees of Finite GraphsJournal of the London Mathematical Society, 1961
- Note on Independence FunctionsProceedings of the London Mathematical Society, 1957
- Systems of Distinct Representations and Linear ProgrammingThe American Mathematical Monthly, 1956
- On the Number of Husimi TreesProceedings of the National Academy of Sciences, 1953
- A THEOREM ON INDEPENDENCE RELATIONSThe Quarterly Journal of Mathematics, 1942
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935