94 search results - page 7 / 19 » Graph Packings |
EJC
2007
13 years 7 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n â...
ANOR
2005
13 years 7 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
SOFSEM
2009
Springer
14 years 2 months ago
2009
Springer
IPCO
2004
13 years 8 months ago
2004
COMBINATORICA
2006
13 years 7 months ago
2006