AbstractThe maximal number of pairwise edge disjoint graphs G of four vertices or less, in the complete graph Kn, and the minimal number of graphs G of four vertices or less, whose union is Kn, are determined
AbstractIn this paper we study two types of edge-disjoint packings of graphs. The induced edge-disjo...
ABSTRACT. The maximum number of pairwise edge disjoint forests of order five in the complete graph K...
AbstractLet G1 and G2 be graphs with n vertices. If there are edge-disjoint copies of G1 and G1 with...
AbstractThe maximal number of pairwise edge disjoint graphs G of four vertices or less, in the compl...
AbstractThe complete graph Kn, is said to have a G-decomposition if it is the union of edge disjoint...
A decomposition of K \L, the complete graph of order n with a subgraph L (called the leave) removed,...
If the complete graph Kn has vertex set X, a minimum covering of K with 4-cycles, (X,C, P), is a par...
The packing and covering problems have been considered for several classes of graphs. For instance, ...
We deal with the concept of packings in graphs, which may be regarded as a generalization of the the...
Abstract. A maximum packing of any k-fold complete multipartite graph (where there are k edges betwe...
Graph packing problem refers to the problem of finding maximum number of edge-disjoint copies of a ...
AbstractWe introduce a new technique for packing pairwise edge-disjoint cycles of specified lengths ...
We introduce a new technique for packing pairwise edge-disjoint cycles of specified lengths in compl...
AbstractLet k=3 or 4, and let n be a natural number not divisible by k−1. Consider any edge coloring...
AbstractA graph G is a common multiple of two graphs H1 and H2 if there exists a decomposition of G ...
AbstractIn this paper we study two types of edge-disjoint packings of graphs. The induced edge-disjo...
ABSTRACT. The maximum number of pairwise edge disjoint forests of order five in the complete graph K...
AbstractLet G1 and G2 be graphs with n vertices. If there are edge-disjoint copies of G1 and G1 with...
AbstractThe maximal number of pairwise edge disjoint graphs G of four vertices or less, in the compl...
AbstractThe complete graph Kn, is said to have a G-decomposition if it is the union of edge disjoint...
A decomposition of K \L, the complete graph of order n with a subgraph L (called the leave) removed,...
If the complete graph Kn has vertex set X, a minimum covering of K with 4-cycles, (X,C, P), is a par...
The packing and covering problems have been considered for several classes of graphs. For instance, ...
We deal with the concept of packings in graphs, which may be regarded as a generalization of the the...
Abstract. A maximum packing of any k-fold complete multipartite graph (where there are k edges betwe...
Graph packing problem refers to the problem of finding maximum number of edge-disjoint copies of a ...
AbstractWe introduce a new technique for packing pairwise edge-disjoint cycles of specified lengths ...
We introduce a new technique for packing pairwise edge-disjoint cycles of specified lengths in compl...
AbstractLet k=3 or 4, and let n be a natural number not divisible by k−1. Consider any edge coloring...
AbstractA graph G is a common multiple of two graphs H1 and H2 if there exists a decomposition of G ...
AbstractIn this paper we study two types of edge-disjoint packings of graphs. The induced edge-disjo...
ABSTRACT. The maximum number of pairwise edge disjoint forests of order five in the complete graph K...
AbstractLet G1 and G2 be graphs with n vertices. If there are edge-disjoint copies of G1 and G1 with...
DOI
Add to ORKG