Covering of graphs by complete bipartite subgraphs; Complexity of 0–1 matrices
- 1 March 1984
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 4 (1) , 111-116
- https://doi.org/10.1007/bf02579163
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Triangle-free partial graphs and edge covering theoremsDiscrete Mathematics, 1982
- Covers in hypergraphsCombinatorica, 1982
- On the coverings of graphsDiscrete Mathematics, 1980
- On a problem of G. O. H. Katona and T. TarjánActa Mathematica Hungarica, 1979
- Distance matrix polynomials of treesAdvances in Mathematics, 1978
- The biparticity of a graphJournal of Graph Theory, 1977
- On complete subgraphs of different ordersMathematical Proceedings of the Cambridge Philosophical Society, 1976
- The Representation of a Graph by Set IntersectionsCanadian Journal of Mathematics, 1966
- Graph Theory and ProbabilityCanadian Journal of Mathematics, 1959
- On a combinatorical problemColloquium Mathematicum, 1958