990 search results - page 6 / 198 » Sub-Graphs of Complete Graph |
JCT
2010
13 years 5 months ago
2010
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...
DAM
2002
13 years 7 months ago
2002
A block graph is a graph whose blocks are cliques. A block duplicate (BD) graph is a graph obtained by adding true twins (i.e., adjacent vertices with the same closed neighborhood...
ECCC
2010
13 years 2 months ago
2010
Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs.
PPOPP
2006
ACM
14 years 1 months ago
2006
ACM
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
DM
1998
13 years 7 months ago
1998
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M b...