König-Egerváry graphs are non-Edmonds
type: Item
instance of: scholarly article
title: König-Egerváry graphs are non-Edmonds
zbMATH Open document ID: 1218.05143
author: P. Mark Kayll
published in: Graphs and Combinatorics
publication date: 2010-11-12T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 52B99
zbMATH DE Number: 5815687
zbMATH Keywords: matching
zbMATH Keywords: perfect matching polytope
zbMATH Keywords: covering
MaRDI profile type: Publication
full work available at URL: s00373-010-0940-y
OpenAlex ID: W2000105603
cites work: Q5834711
cites work: Q5422499
cites work: The perfect matching polytope and solid bricks
cites work: Independence numbers of graphs - an extension of the Koenig-Egervary theorem
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Paths, Trees, and Flowers
cites work: Q5519710
cites work: A characterization of the graphs in which the transversal number equals the matching number
cites work: Q5817856
DOI: 10.1007/S00373-010-0940-Y
description: scientific article; zbMATH DE number 5815687