4255 search results - page 100 / 851 » Cover |
150
click to vote
DM
2002
15 years 3 months ago
2002
Let G be a tree and let H be a collection of subgraphs of G, each having at most d connected components. Let (H) denote the maximum number of members of H no two of which share a ...
DM
2002
15 years 3 months ago
2002
104
Voted
IJDAR
2000
15 years 3 months ago
2000
135
Voted
ENDM
2002
15 years 3 months ago
2002
A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if...