Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
- 1 March 1983
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 3 (1) , 35-52
- https://doi.org/10.1007/bf02579340
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Perfect triangle-free 2-matchingsPublished by Springer Nature ,1980
- A matching problem with side conditionsDiscrete Mathematics, 1980
- Minimum node covers and 2-bicritical graphsMathematical Programming, 1979
- Facets of I-matching polyhedraLecture Notes in Mathematics, 1974
- Perfect matchings of a graphJournal of Combinatorial Theory, Series B, 1971
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- The Factors of GraphsCanadian Journal of Mathematics, 1952
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947