König-Egerváry graphs, 2-bicritical graphs and fractional matchings
- 31 December 1989
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 24 (1-3) , 63-82
- https://doi.org/10.1016/0166-218x(92)90273-d
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Node-weighted graphs having the König-Egerváry propertyPublished by Springer Nature ,1984
- Ear-decompositions of matching-covered graphsCombinatorica, 1983
- Vertices Belonging to All or to No Maximum Stable Sets of a GraphSIAM Journal on Algebraic Discrete Methods, 1982
- Independence numbers of graphs-an extension of the Koenig-Egervary theoremDiscrete Mathematics, 1979
- Minimum node covers and 2-bicritical graphsMathematical Programming, 1979
- A characterization of the graphs in which the transversal number equals the matching numberJournal of Combinatorial Theory, Series B, 1979
- On the integer-valued variables in the linear vertex packing problemMathematical Programming, 1977
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965