94 search results - page 6 / 19 » Graph Packings |
92
Voted
STOC
2010
ACM
15 years 9 months ago
2010
ACM
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...
101
Voted
CPC
2007
15 years 4 days ago
2007
Let G be a graph with no three independent vertices. How many edges of G can be packed with edge-disjoint copies of Kk? More specifically, let fk(n, m) be the largest integer t s...
STOC
2004
ACM
16 years 13 days ago
2004
ACM
In this paper, we address two longstanding questions about finding good separators in graphs of bounded genus and degree:
84
Voted
DM
2010
15 years 7 days ago
2010
For a graph G let
RECOMB
2004
Springer
16 years 14 days ago
2004
Springer
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...