With the help of the concept of a linking system, theorems relating matroids with bipartite graphs and directed graphs are deduced. In this way natural generalizations of theorems of Edmonds & Fulkerson, Perfect, Pym. Rado, Brualdi and Mason are obtained. Furthermore some other properties of these linking systems are investigated
We show how pairs of signed graphs with the same even cycles relate to pairs of grafts with the same...
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
With the help of the concept of a linking system, theorems relating matroids with bipartite graphs a...
AbstractWith the help of the concept of a linking system, theorems relating matroids with bipartite ...
In this paper we consider a linking operation between matroids, defined as M-SP M-S= (M-SP V M-S) X...
We introduce for oriented matroids a generalization of the concepts of intersection and linking numb...
We present two systems of closure axioms for a matroid with the assistance of Galois connections. Th...
AbstractIn this paper we suggest a generalization of the well known concept of matroid. This include...
AbstractMatroidal families are defined as families of connected graphs such that, given any graph G,...
In this paper we derive several results for connected matroids and use these to obtain new results f...
We show how pairs of signed graphs with the same even cycles relate to pairs of grafts with the same...
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
AbstractThe domination invariant has played an important part in reliability theory. While most of t...
Abstract. The domination function has played an important part in reliability the-ory. While most of...
We show how pairs of signed graphs with the same even cycles relate to pairs of grafts with the same...
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
With the help of the concept of a linking system, theorems relating matroids with bipartite graphs a...
AbstractWith the help of the concept of a linking system, theorems relating matroids with bipartite ...
In this paper we consider a linking operation between matroids, defined as M-SP M-S= (M-SP V M-S) X...
We introduce for oriented matroids a generalization of the concepts of intersection and linking numb...
We present two systems of closure axioms for a matroid with the assistance of Galois connections. Th...
AbstractIn this paper we suggest a generalization of the well known concept of matroid. This include...
AbstractMatroidal families are defined as families of connected graphs such that, given any graph G,...
In this paper we derive several results for connected matroids and use these to obtain new results f...
We show how pairs of signed graphs with the same even cycles relate to pairs of grafts with the same...
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
AbstractThe domination invariant has played an important part in reliability theory. While most of t...
Abstract. The domination function has played an important part in reliability the-ory. While most of...
We show how pairs of signed graphs with the same even cycles relate to pairs of grafts with the same...
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
DOI
Add to ORKG