|
|||||
|
|
Covering a graph by complete bipartite graphs |
|
| Affiliation: | Mathematical Institute of the Hungarian Academy of Sciences, P.O. Box 127, H-1364, Budapest, Hungary |
| Abstract: | We prove the following theorem: the edge set of every graph G on n vertices can be partitioned into the disjoint union of complete bipartite graphs such that each vertex is contained by at most c(n/log n) of the bipartite graphs. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |