DOIAbstract
AbstractLet G be a graph of order n. We prove that if the size of G is less than or equal to n−2(k−1)3, then the complete graph Kn contains k edge-disjoint copies of G. The case k=2 is well known
AbstractLet G be a graph of order n. We prove that if the size of G is less than or equal to n−2(k−1)3, then the complete graph Kn contains k edge-disjoint copies of G. The case k=2 is well known
We show that if a graph contains few copies of a given graph, then its edges are distributed rather ...
AbstractLet k, l, n be nonnegative integers such that 1⩽k⩽n/2, and let G be a graph of order n with ...
AbstractWe present some results concerning edge-disjoint placement of two or three copies of a tree,...
AbstractLet G be a graph of order n. We prove that if the size of G is less than or equal to n−2(k−1...
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...
AbstractA three T of order n is said to be 3-placeable if there are three edge-disjoint copies of T ...
AbstractA graph H of order n is said to be k-placeable into a graph G of order n, if G contains k ed...
This dissertation concerns two related problems within Graph Theory. The first problem involves the ...
Let G be a graph of order n. Let K¯ₗ be the graph obtained from Kₗ by removing one edge. In this pap...
AbstractWe prove that three graphs of order n and size less than or equal to n−3 can be packed (edge...
AbstractIn this paper we study two types of edge-disjoint packings of graphs. The induced edge-disjo...
In [T. Böhme A. Kostochka, Many disjoint dense subgraphs versus large k-connected subgraphs in large...
AbstractIt is well known that if a tree T of order n is not a star, then there exists an edge-disjoi...
Consider a graph G on n vertices with αn 2 edges which does not contain an induced K2,t (t > 2). How...
This paper surveys some recent results and new techniques concerning edge-disjoint decompositions of...
We show that if a graph contains few copies of a given graph, then its edges are distributed rather ...
AbstractLet k, l, n be nonnegative integers such that 1⩽k⩽n/2, and let G be a graph of order n with ...
AbstractWe present some results concerning edge-disjoint placement of two or three copies of a tree,...
AbstractLet G be a graph of order n. We prove that if the size of G is less than or equal to n−2(k−1...
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...
AbstractA three T of order n is said to be 3-placeable if there are three edge-disjoint copies of T ...
AbstractA graph H of order n is said to be k-placeable into a graph G of order n, if G contains k ed...
This dissertation concerns two related problems within Graph Theory. The first problem involves the ...
Let G be a graph of order n. Let K¯ₗ be the graph obtained from Kₗ by removing one edge. In this pap...
AbstractWe prove that three graphs of order n and size less than or equal to n−3 can be packed (edge...
AbstractIn this paper we study two types of edge-disjoint packings of graphs. The induced edge-disjo...
In [T. Böhme A. Kostochka, Many disjoint dense subgraphs versus large k-connected subgraphs in large...
AbstractIt is well known that if a tree T of order n is not a star, then there exists an edge-disjoi...
Consider a graph G on n vertices with αn 2 edges which does not contain an induced K2,t (t > 2). How...
This paper surveys some recent results and new techniques concerning edge-disjoint decompositions of...
We show that if a graph contains few copies of a given graph, then its edges are distributed rather ...
AbstractLet k, l, n be nonnegative integers such that 1⩽k⩽n/2, and let G be a graph of order n with ...
AbstractWe present some results concerning edge-disjoint placement of two or three copies of a tree,...
Add to ORKG