NP-completeness of some problems of partitioning and covering in graphs
Author:
- B. PérocheBPB. Péroche
- 31 May 1984
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 8 (2) , 195-208
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The Path-Numbers of Some Multipartite Graphs1980
- Path decompositions of digraphsBulletin of the Australian Mathematical Society, 1974
- COVERING AND PACKING IN GRAPHS, I.Annals of the New York Academy of Sciences, 1970