Covering a graph by circuits
- 1 January 1978
- book chapter
- Published by Springer Nature
- p. 289-299
- https://doi.org/10.1007/3-540-08860-1_21
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- On maximally distant spanning trees of a graphComputing, 1976
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972