H. Kheddouci, J.F. Saclé and M. Woźniak conjectured in 2000 that if a tree T is not a star, then there is an edge-disjoint placement of T into its third power.In this paper, we prove the conjecture for caterpillars
AbstractWe present the complete result concerning the packing (i.e. the edge-disjoint placement) of ...
A caterpillar is a connected graph such that the removal of all its vertices with degree 1 results i...
Given a graph G, a subset S ⊆ V (G) is an independent [1, 2]-set if no two vertices in S are adjacen...
AbstractIt is proved in [1] that if a tree T of order n is not a star, then there exists an edge-dis...
AbstractIt is well known that if a tree T of order n is not a star, then there exists an edge-disjoi...
AbstractWe present some results concerning edge-disjoint placement of two or three copies of a tree,...
AbstractA graph H of order n is said to be k-placeable into a graph G of order n, if G contains k ed...
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 ...
The Gyárfás tree packing conjecture asserts that any set of trees with 2,3,...,k vertices has an (ed...
A caterpillar is a tree in which the removal of all pendant vertices makes it a path. Let d ≥ 3 and...
A caterpillar is a tree in which the removal of all pendent vertices make it a path. In this paper, ...
The Gy´arf´as-Sumner conjecture asserts that if H is a tree then every graph with bounded clique num...
The family of all independent k-sets of a graph containing a fixed vertex v is called a star and v i...
AbstractWe present complete results concerning edge-disjoint placement of three trees of orderninto ...
AbstractWe present the complete result concerning the packing (i.e. the edge-disjoint placement) of ...
A caterpillar is a connected graph such that the removal of all its vertices with degree 1 results i...
Given a graph G, a subset S ⊆ V (G) is an independent [1, 2]-set if no two vertices in S are adjacen...
AbstractIt is proved in [1] that if a tree T of order n is not a star, then there exists an edge-dis...
AbstractIt is well known that if a tree T of order n is not a star, then there exists an edge-disjoi...
AbstractWe present some results concerning edge-disjoint placement of two or three copies of a tree,...
AbstractA graph H of order n is said to be k-placeable into a graph G of order n, if G contains k ed...
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 ...
The Gyárfás tree packing conjecture asserts that any set of trees with 2,3,...,k vertices has an (ed...
A caterpillar is a tree in which the removal of all pendant vertices makes it a path. Let d ≥ 3 and...
A caterpillar is a tree in which the removal of all pendent vertices make it a path. In this paper, ...
The Gy´arf´as-Sumner conjecture asserts that if H is a tree then every graph with bounded clique num...
The family of all independent k-sets of a graph containing a fixed vertex v is called a star and v i...
AbstractWe present complete results concerning edge-disjoint placement of three trees of orderninto ...
AbstractWe present the complete result concerning the packing (i.e. the edge-disjoint placement) of ...
A caterpillar is a connected graph such that the removal of all its vertices with degree 1 results i...
Given a graph G, a subset S ⊆ V (G) is an independent [1, 2]-set if no two vertices in S are adjacen...
DOI
Add to ORKG