References
- N. Alon, P. Frankl, and V. Rödl, Geometric realization of set systems and probalistic communication complexity, Proceedings on 26th Annual Symposium on Foundations of Computer Science, 1985.
- S. Bailey, To Dot Products and Beyond, Ph.D. diss., Utah State University, 2016
- F.R.K. Chung, On the coverings of graphs, Discr. Math. 30 (1980), pp. 89–93. doi: 10.1016/0012-365X(80)90109-0
- F.R.K. Chung, P Erdös, and J Spencer, On the decomposition of graphs into complete bipartite subgraphs, Studies in Pure Mathematics, Mem. of P. Turán. (1983), pp. 95–101.
- P. Erdös and L. Pyber, Covering a graph by complete bipartite subgraphs, Discr. Math. 170 (1997), pp. 249–251. doi: 10.1016/S0012-365X(96)00124-0
- C. Fiduccia, E. Scheinerman, A. Trenk, and J. Zito, Dot product representation of graphs, Discr. Math. 181 (1998), pp. 113–138. doi: 10.1016/S0012-365X(97)00049-6
- P. Hammer, U.N. Peled, and X. Su, Difference graphs, Discr. Appl. Math. 28 (1990), pp. 35–44. doi: 10.1016/0166-218X(90)90092-Q
- F. Haray, J. Kabell, and F. McMorris, Bipartite intersection graphs, Comment Math. Univer. Carolinae23 (1982), pp. 739–745.
- R. Horn and C. Johnson, Matrix analysis, Cambridge University Press, New York, NY, 2005.
- M. Johnson, E. van Leeuwen, and D. Paulusma, What graphs are 2-dot product graphs? Electon. Notes Discr. Math. 49 (2015), pp. 705–711. doi: 10.1016/j.endm.2015.06.095
- S. Jukna and A. Kulikov, On covering graphs by complete bipartite subgraphs, Discr. Math. 309 (2009), pp. 3399–3403. doi: 10.1016/j.disc.2008.09.036
- D. Mubayi and S. Vishwanathan, Bipartite coverings and the chromatics number, Electron. J. Combin. 16 (2009), p. N34. doi: 10.37236/272
- J. Reiterman, V. Rödl, and E. Šiňajová, Dot product representation of graphs, Discr. Math. 74 (1989), pp. 291–319. doi: 10.1016/0012-365X(89)90142-8