Minimum node covers and 2-bicritical graphs
- 1 December 1979
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 17 (1), 91-103
- https://doi.org/10.1007/bf01588228
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Determining the Chromatic Number of a GraphSIAM Journal on Computing, 1979
- On the integer-valued variables in the linear vertex packing problemMathematical Programming, 1977
- Determining the Stability Number of a GraphSIAM Journal on Computing, 1977
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975
- On colouring random graphsMathematical Proceedings of the Cambridge Philosophical Society, 1975
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Integer Programming: Methods, Uses, ComputationsManagement Science, 1965
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- The Factors of GraphsCanadian Journal of Mathematics, 1952
- Some remarks on the theory of graphsBulletin of the American Mathematical Society, 1947