Brick decompositions and the matching rank of graphs
type: Item
instance of: scholarly article
title: Brick decompositions and the matching rank of graphs
zbMATH Open document ID: 0521.05035
DOI: 10.1007/BF02579233
author: Jack Edmonds
author: William R. Pulleyblank
author: László Lovász
published in: Combinatorica
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 3823824
zbMATH Keywords: perfect matching polytope
zbMATH Keywords: bicritical graph
MaRDI profile type: Publication
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Paths, Trees, and Flowers
cites work: Matroid Intersection
cites work: Systems of distinct representatives and linear algebra
cites work: Q5508779
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Q3267903
cites work: On the structure of factorizable graphs
cites work: On maximal independent sets of vertices in claw-free graphs
cites work: Rank of maximum matchings in a graph
cites work: Matchings in regular graphs
cites work: Dual integrality in b-matching problems
cites work: Q4078069
description: scientific article; zbMATH DE number 3823824