AbstractA matroid generalization is given to a theorem of Mendelsohn and Dulmage concerning assignments in bipartite graphs. The generalized theorem has applications to optimization theory and provides a simple proof of a theorem of Nash-Williams
International audienceOn two conjectures of Maurer concerning basis graphs of matroid
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
"If a theorem about graphs can be expressed in terms of edges and circuits only it probably exe...
AbstractA matroid generalization is given to a theorem of Mendelsohn and Dulmage concerning assignme...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
AbstractThe polymatroid matching problem, also known as the matchoid problem or the matroid parity p...
The Dulmage-Mendelsohn decomposition is a classical canonical decomposition in matching theory appli...
Matroids were first defined in 1935 as an abstract generalization of graphs and matrices. In the sub...
Abstract. We introduce a notion of duality (due to Brylawski) that gener-alizes matroid duality to a...
AbstractTwo edges of a graph are said to form a couple when their nodes can be labelled A, B, C, D s...
A new kind of matroid is introduced: this matroid is defined starting from any matroid and one of it...
AbstractFor a graph G with at least one edge, define d(G) = |E(G)||V(G)| and m(G) = maxH ⊆ G d(H). K...
We present a general model for set systems to be independence families with respect to set families ...
AbstractMatroid theory has been applied to solve problems in generalized assignment, operations rese...
AbstractA proof is given of the result about binary matroids that implies that a connected graph is ...
International audienceOn two conjectures of Maurer concerning basis graphs of matroid
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
"If a theorem about graphs can be expressed in terms of edges and circuits only it probably exe...
AbstractA matroid generalization is given to a theorem of Mendelsohn and Dulmage concerning assignme...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
AbstractThe polymatroid matching problem, also known as the matchoid problem or the matroid parity p...
The Dulmage-Mendelsohn decomposition is a classical canonical decomposition in matching theory appli...
Matroids were first defined in 1935 as an abstract generalization of graphs and matrices. In the sub...
Abstract. We introduce a notion of duality (due to Brylawski) that gener-alizes matroid duality to a...
AbstractTwo edges of a graph are said to form a couple when their nodes can be labelled A, B, C, D s...
A new kind of matroid is introduced: this matroid is defined starting from any matroid and one of it...
AbstractFor a graph G with at least one edge, define d(G) = |E(G)||V(G)| and m(G) = maxH ⊆ G d(H). K...
We present a general model for set systems to be independence families with respect to set families ...
AbstractMatroid theory has been applied to solve problems in generalized assignment, operations rese...
AbstractA proof is given of the result about binary matroids that implies that a connected graph is ...
International audienceOn two conjectures of Maurer concerning basis graphs of matroid
AbstractThree types of matroid connectivity, including Tutte's, are defined and shown to generalize ...
"If a theorem about graphs can be expressed in terms of edges and circuits only it probably exe...
DOI
Add to ORKG