AbstractIt is well known that if a tree T of order n is not a star, then there exists an edge-disjoint placement of two copies of this tree into the complete graph Kn.We improve this result by proving that actually two copies of T can be edge-disjointly packed in a much smaller graph, namely in T4, the 4th power of T
AbstractWe present complete results concerning edge-disjoint placement of three trees of orderninto ...
AbstractNash-Williams and Tutte independently characterized when a graph has k edge-disjoint spannin...
We give a short elementary proof of Tutte and Nash-Williams' characterization of graphs with k ...
AbstractIt is proved in [1] that if a tree T of order n is not a star, then there exists an edge-dis...
AbstractA graph H of order n is said to be k-placeable into a graph G of order n, if G contains k ed...
AbstractWe present some results concerning edge-disjoint placement of two or three copies of a tree,...
H. Kheddouci, J.F. Saclé and M. Woźniak conjectured in 2000 that if a tree T is not a star, then the...
This dissertation concerns two related problems within Graph Theory. The first problem involves the ...
summary:In considering packing three copies of a tree into a complete bipartite graph, H. Wang (2009...
AbstractLet G be a simple graph of order n and size e(G). It is well known that if e(G)⩽n−2 then the...
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 ...
AbstractIn this paper we study two types of edge-disjoint packings of graphs. The induced edge-disjo...
AbstractA three T of order n is said to be 3-placeable if there are three edge-disjoint copies of T ...
A conjecture of Gy´arf´as and Lehel asks if the sequence of trees T1, T2, ..., Tn, where Ti is a tre...
AbstractWe present complete results concerning edge-disjoint placement of three trees of orderninto ...
AbstractNash-Williams and Tutte independently characterized when a graph has k edge-disjoint spannin...
We give a short elementary proof of Tutte and Nash-Williams' characterization of graphs with k ...
AbstractIt is proved in [1] that if a tree T of order n is not a star, then there exists an edge-dis...
AbstractA graph H of order n is said to be k-placeable into a graph G of order n, if G contains k ed...
AbstractWe present some results concerning edge-disjoint placement of two or three copies of a tree,...
H. Kheddouci, J.F. Saclé and M. Woźniak conjectured in 2000 that if a tree T is not a star, then the...
This dissertation concerns two related problems within Graph Theory. The first problem involves the ...
summary:In considering packing three copies of a tree into a complete bipartite graph, H. Wang (2009...
AbstractLet G be a simple graph of order n and size e(G). It is well known that if e(G)⩽n−2 then the...
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 ...
AbstractIn this paper we study two types of edge-disjoint packings of graphs. The induced edge-disjo...
AbstractA three T of order n is said to be 3-placeable if there are three edge-disjoint copies of T ...
A conjecture of Gy´arf´as and Lehel asks if the sequence of trees T1, T2, ..., Tn, where Ti is a tre...
AbstractWe present complete results concerning edge-disjoint placement of three trees of orderninto ...
AbstractNash-Williams and Tutte independently characterized when a graph has k edge-disjoint spannin...
We give a short elementary proof of Tutte and Nash-Williams' characterization of graphs with k ...
DOI
Add to ORKG