Covering a graph by complete bipartite graphs

Authors:
P. Erdős;L. Pyber
Affiliations:
-;-
Venue:
Discrete Mathematics
Year:
1997

Citing 0
Cited 3

Optimizing combinatorial library construction via split synthesis

RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Determination of the star valency of a graph

Discrete Applied Mathematics
On-line secret sharing

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.06

Visualization

Abstract