A conjecture of Gy´arf´as and Lehel asks if the sequence of trees T1, T2, ..., Tn, where Ti is a tree on i vertices, can be packed into Kn. We show that if each Ti is restricted to a star or a path, then the sequence can be packed. We also give an explicit construction for a restricted case when the paths and stars alternate.Technical report DCS-TR-68
AbstractLet G be a graph and let v be a vertex of G. The open neighbourhood N(v) of v is the set of ...
We prove that for any pair of constants ε > 0 and ∆ and for n sufficiently large, every family of tr...
We prove that given any sequence of $n$ bounded degree trees so that the $j$th tree has $j$ vertices...
A conjecture of Gyárfás and Lehel asks if the sequence of trees T1, T2,..., Tn, where Ti is a tree...
The Gyárfás tree packing conjecture asserts that any set of trees with 2,3,...,k vertices has an (ed...
AbstractLet T2, …, T1 be a sequence of trees, where Ti has i vertices. We show that if t<0.79n, then...
AbstractIn this note we improve significantly the result appeared in [4] by showing that any sequenc...
We deal with the concept of packings in graphs, which may be regarded as a generalization of the the...
We prove that if T1,…,Tn is a sequence of bounded degree trees such that Ti has i vertices, then Kn ...
summary:In considering packing three copies of a tree into a complete bipartite graph, H. Wang (2009...
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common ...
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common ...
Let ℋ be a family of graphs. An ℋ-packing of a graph G is a set {G1, G2,…,Gk} of disjoint subgraphs ...
Let lambda K(n) denote the complete graph of order n and multiplicity lambda. We prove Tarsi's conje...
AbstractWe define a k-limited packing in a graph, which generalizes a 2-packing in a graph, and give...
AbstractLet G be a graph and let v be a vertex of G. The open neighbourhood N(v) of v is the set of ...
We prove that for any pair of constants ε > 0 and ∆ and for n sufficiently large, every family of tr...
We prove that given any sequence of $n$ bounded degree trees so that the $j$th tree has $j$ vertices...
A conjecture of Gyárfás and Lehel asks if the sequence of trees T1, T2,..., Tn, where Ti is a tree...
The Gyárfás tree packing conjecture asserts that any set of trees with 2,3,...,k vertices has an (ed...
AbstractLet T2, …, T1 be a sequence of trees, where Ti has i vertices. We show that if t<0.79n, then...
AbstractIn this note we improve significantly the result appeared in [4] by showing that any sequenc...
We deal with the concept of packings in graphs, which may be regarded as a generalization of the the...
We prove that if T1,…,Tn is a sequence of bounded degree trees such that Ti has i vertices, then Kn ...
summary:In considering packing three copies of a tree into a complete bipartite graph, H. Wang (2009...
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common ...
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common ...
Let ℋ be a family of graphs. An ℋ-packing of a graph G is a set {G1, G2,…,Gk} of disjoint subgraphs ...
Let lambda K(n) denote the complete graph of order n and multiplicity lambda. We prove Tarsi's conje...
AbstractWe define a k-limited packing in a graph, which generalizes a 2-packing in a graph, and give...
AbstractLet G be a graph and let v be a vertex of G. The open neighbourhood N(v) of v is the set of ...
We prove that for any pair of constants ε > 0 and ∆ and for n sufficiently large, every family of tr...
We prove that given any sequence of $n$ bounded degree trees so that the $j$th tree has $j$ vertices...
DOI
Add to ORKG