Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference11 articles.
1. Cameron, K.: The maximum edge-weighted clique problem in complete multipartite graphs. J. Combin. Math. Combin. Comput. 9, 33–37 (1991)
2. Cockayne, E.J., Hartnell, B.L.: Edge partitions of complete multipartite graphs into equal length circuits. J. Combinatorial Theory Ser. B 23 (2-3) 174–183 (1977)
3. Cornaz, D., Fonlupt, J.: Chromatic characterization of biclique covers, to appear in Discrete Math.
4. Fishburn, P.C., Hammer, P.L.: Bipartite dimensions and bipartite degrees of graphs. Discrete Math. 160, 127–148 (1996)
5. Gregory, D.A., Vander, Meulen, K.N.: Sharp bounds for decompositions of graphs into complete r-partite subgraphs. J. Graph Theory 21 (4) 393–400 (1996)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. TSec: An Efficient and Effective Framework for Time Series Classification;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13
2. Proteinortho: Detection of (Co-)orthologs in large-scale analysis;BMC Bioinformatics;2011-04-28
3. On co-bicliques;RAIRO - Operations Research;2007-07