AbstractThe maximum tree packing problem asks to pack the greatest possible number of vertex-disjoint trees isomorphic to a fixed tree T0, into a given input tree T. We give a linear time algorithm for this problem
We prove that for any pair of constants ε > 0 and ∆ and for n sufficiently large, every family of tr...
We prove that there is $c>0$ such that for all sufficiently large $n$, if $T_1,\dots,T_n$ are any tr...
We prove that for any pair of constants a>0 and D and for n sufficiently large, every family of tree...
AbstractThe maximum tree packing problem asks to pack the greatest possible number of vertex-disjoin...
AbstractThe problem of determining the maximum number of node-disjoint subtrees of a tree T on nt no...
AbstractThe problem of determining the maximum number of node-disjoint subtrees of a tree T on nt no...
Let ℋ be a family of graphs. An ℋ-packing of a graph G is a set {G1, G2,…,Gk} of disjoint subgraphs ...
Maximum G Edge-Packing (EPackG) is the problem of finding the maximum number of edge-disjoint isomor...
AbstractLet F be a fixed edge-colored graph. We consider the problem of packing the greatest possibl...
The overarching problem of this project was trying to find the maximal number of disjoint subgraphs ...
AbstractPacking coloring is a partitioning of the vertex set of a graph with the property that verti...
AbstractThe problem of determining the maximum number of node-disjoint subgraphs of a partial k-tree...
AbstractThe problem of determining the maximum number of vertex-disjoint subgraphs of a biconnected ...
AbstractLet F be a fixed edge-colored graph. We consider the problem of packing the greatest possibl...
We prove that for any pair of constants ε > 0 and ∆ and for n sufficiently large, every family of tr...
We prove that for any pair of constants ε > 0 and ∆ and for n sufficiently large, every family of tr...
We prove that there is $c>0$ such that for all sufficiently large $n$, if $T_1,\dots,T_n$ are any tr...
We prove that for any pair of constants a>0 and D and for n sufficiently large, every family of tree...
AbstractThe maximum tree packing problem asks to pack the greatest possible number of vertex-disjoin...
AbstractThe problem of determining the maximum number of node-disjoint subtrees of a tree T on nt no...
AbstractThe problem of determining the maximum number of node-disjoint subtrees of a tree T on nt no...
Let ℋ be a family of graphs. An ℋ-packing of a graph G is a set {G1, G2,…,Gk} of disjoint subgraphs ...
Maximum G Edge-Packing (EPackG) is the problem of finding the maximum number of edge-disjoint isomor...
AbstractLet F be a fixed edge-colored graph. We consider the problem of packing the greatest possibl...
The overarching problem of this project was trying to find the maximal number of disjoint subgraphs ...
AbstractPacking coloring is a partitioning of the vertex set of a graph with the property that verti...
AbstractThe problem of determining the maximum number of node-disjoint subgraphs of a partial k-tree...
AbstractThe problem of determining the maximum number of vertex-disjoint subgraphs of a biconnected ...
AbstractLet F be a fixed edge-colored graph. We consider the problem of packing the greatest possibl...
We prove that for any pair of constants ε > 0 and ∆ and for n sufficiently large, every family of tr...
We prove that for any pair of constants ε > 0 and ∆ and for n sufficiently large, every family of tr...
We prove that there is $c>0$ such that for all sufficiently large $n$, if $T_1,\dots,T_n$ are any tr...
We prove that for any pair of constants a>0 and D and for n sufficiently large, every family of tree...
DOI
Add to ORKG