An algorithm for a minimum cover of a graph
Authors:
Robert Z. Norman and Michael O. Rabin
Journal:
Proc. Amer. Math. Soc. 10 (1959), 315-319
MSC:
Primary 05.00
DOI:
https://doi.org/10.1090/S0002-9939-1959-0106853-5
MathSciNet review:
0106853
Full-text PDF
References | Similar Articles | Additional Information
- [1] Claude Berge, Two theorems in graph theory, Proc. Nat. Acad. Sci. U.S.A. 43 (1957), 842–844. MR 0094811
- [2] Julius Petersen, Die Theorie der regulären graphs, Acta Math. 15 (1891), no. 1, 193–220 (German). MR 1554815, https://doi.org/10.1007/BF02392606
- [3] J. Paul Roth, Algebraic topological methods for the synthesis of switching systems. I, Trans. Amer. Math. Soc. 88 (1958), 301–326. MR 0097285, https://doi.org/10.1090/S0002-9947-1958-0097285-0
Retrieve articles in Proceedings of the American Mathematical Society with MSC: 05.00
Retrieve articles in all journals with MSC: 05.00
Additional Information
DOI:
https://doi.org/10.1090/S0002-9939-1959-0106853-5
Article copyright:
© Copyright 1959
American Mathematical Society
