The parity problem of polymatroids without double circuits
type: Item
instance of: scholarly article
title: The parity problem of polymatroids without double circuits
zbMATH Open document ID: 1212.05032
author: Márton Makai
author: Jácint Szabó
published in: Combinatorica
publication date: 2010-08-13T00:00:00Z
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 5770353
zbMATH Keywords: polymatroids
zbMATH Keywords: matroid parity problem
zbMATH Keywords: double circuits
zbMATH Keywords: maximum matching
MaRDI profile type: Publication
full work available at URL: s00493-008-2374-1
OpenAlex ID: W2074213938
cites work: On some combinatorial properties of algebraic matroids
cites work: An orientation theorem with parity conditions
cites work: On the orientation of graphs and hypergraphs
cites work: On the orientation of graphs
cites work: Complexity of Matroid Property Algorithms
cites work: On graphs and rigidity of plane skeletal structures
cites work: Matroid matching and some applications
cites work: Q3896158
cites work: On Generic Rigidity in the Plane
cites work: Q5306146
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
DOI: 10.1007/S00493-008-2374-1
Recommended article: Matching Problems in Polymatroids Without Double Circuits
Recommended article: Q3424791
Recommended article: THE CRITICAL PROBLEM FOR POLYMATROIDS
Recommended article: On the graphic matroid parity problem
Recommended article: Parity polytopes and binarization
Recommended article: On matroid parity and matching polytopes
Recommended article: A polynomial algorithm for the parity path problem on perfectly orientable graphs
Recommended article: Parity systems and the delta-matroid intersection problem
Recommended article: Parity, Eulerian subgraphs and the Tutte polynomial
Recommended article: The linear delta-matroid parity problem
description: scientific article; zbMATH DE number 5770353