94 search results - page 5 / 19 » Graph Packings |
JCT
2008
13 years 7 months ago
2008
We study packings of graphs with given maximal degree. We shall prove that the (hitherto unproved) Bollob
ENDM
2010
13 years 7 months ago
2010
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...
CCCG
2009
13 years 8 months ago
2009
We prove that, for every two n-node non-star trees of diameter at most four, there exists an n-node planar graph containing them as edge-disjoint subgraphs.
COMBINATORICS
2007
13 years 7 months ago
2007
A graph is self-complementary if it is isomorphic to its complement. In this paper we prove that every forest of order 4p and size less than 3p is a subgraph of a self-complementa...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...