Publisher
Springer International Publishing
Reference13 articles.
1. Alavi, Y., Behzad, M., Lesniak-Foster, L.M., Nordhaus, E.: Total matchings and total coverings of graphs. J. Graph Theory 1(2), 135–140 (1977)
2. Lecture Notes in Computer Science;H Fernau,2006
3. Texts in Theoretical Computer Science. An EATCS Series;Fedor V. Fomin,2010
4. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)
5. Hatami, P.: An approximation algorithm for the total covering problem. Discussiones Mathematicae Graph Theory 27(3), 553–558 (2007)