4 search results - page 1 / 1 » Decomposing complete graphs into isomorphic subgraphs with s... |
ARSCOM
2006
13 years 5 months ago
2006
NETWORKS
2008
13 years 5 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
COMBINATORICA
2007
13 years 5 months ago
2007
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...