Showing 1 - 2 of 2
This paper deals with the problem of representing the matching independence system in a graph as the intersection of finitely many matroids. After characterizing the graphs for which the matching independence system is the intersection of two matroids, we study the function μ(G), which is the...
Persistent link: https://www.econbiz.de/10010999794
This paper deals with the problem of representing the matching independence system in a graph as the intersection of finitely many matroids. After characterizing the graphs for which the matching independence system is the intersection of two matroids, we study the function μ(G), which is the...
Persistent link: https://www.econbiz.de/10010759390