Sharp bounds for decompositions of graph
β
Gregory, David A.; Vander Meulen, Kevin N.
π
Article
π
1996
π
John Wiley and Sons
π
English
β 435 KB
π 2 views
If G is a graph on n vertices and r 2 2, w e let m,(G) denote the minimum number of complete multipartite subgraphs, with r or fewer parts, needed to partition the edge set, f(G). In determining m,(G), w e may assume that no two vertices of G have the same neighbor set. For such reduced graphs G, w