GRAPH-REALIZABILITY OF MATROIDS
- 1 May 1979
- journal article
- Published by Wiley in Annals of the New York Academy of Sciences
- Vol. 319 (1) , 289-305
- https://doi.org/10.1111/j.1749-6632.1979.tb32804.x
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Une relation de séparation entre cocircuits d'un matroideJournal of Combinatorial Theory, Series B, 1974
- Connectivity in MatroidsCanadian Journal of Mathematics, 1966
- Single-element extensions of matroidsJournal 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
- Irredundant and redundant Boolean branch-networksIEEE Transactions on Information Theory, 1959
- Matroids and GraphsTransactions of the American Mathematical Society, 1959
- Graphs and Vector SpacesJournal of Mathematics and Physics, 1958
- A structural characterization of planar combinatorial graphsDuke Mathematical Journal, 1937
- Non-Separable and Planar GraphsTransactions of the American Mathematical Society, 1932
- Congruent Graphs and the Connectivity of GraphsAmerican Journal of Mathematics, 1932