Add to ORKGWe find both necessary and sufficient conditions for the existence of a (C6C overscore 6)-multidecomposition of the complete graph on n vertices. We also investigate maximum (C6C overscore 6)-multipackings of the complete graph, obtaining partial results
We introduce a new technique for packing pairwise edge-disjoint cycles of specified lengths in compl...
A total dominating set in a graph G is a set S of vertices of G such that every vertex in G is adjac...
Every connected graph folds onto some complete graph which is not necessarily unique. It is known th...
We find both necessary and sufficient conditions for the existence of a (C6C overscore 6)-multidecom...
A graph is a mathematical structure consisting of a set of objects called vertices and a set of 2-el...
Given two graphs G and H, a (G,H)-multidecomposition of Kn is a partition of the edges of Kn into co...
We call T = (G1, G2, G3) a graph-triple of order t if the Gi are pairwise non-isomorphic graphs on t...
ABSTRACT. The maximum number of pairwise edge disjoint forests of order five in the complete graph K...
Abstract. A maximum packing of any k-fold complete multipartite graph (where there are k edges betwe...
Firstly, a graph G consists of a vertex set V (G), and an edge set E (G) of endpoints which relate t...
A directed graph is a way to encode information about directional relationships among objects. The c...
AbstractThe maximal number of pairwise edge disjoint graphs G of four vertices or less, in the compl...
In 2001, Erwin introduced broadcast domination in graphs. It is a variant of classical domination wh...
A 6-star is the complete bipartite graph $K_{1,6}$. A \emph{packing of $K_{n}$ with 6-stars} is a se...
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...
A total dominating set in a graph G is a set S of vertices of G such that every vertex in G is adjac...
Every connected graph folds onto some complete graph which is not necessarily unique. It is known th...
We find both necessary and sufficient conditions for the existence of a (C6C overscore 6)-multidecom...
A graph is a mathematical structure consisting of a set of objects called vertices and a set of 2-el...
Given two graphs G and H, a (G,H)-multidecomposition of Kn is a partition of the edges of Kn into co...
We call T = (G1, G2, G3) a graph-triple of order t if the Gi are pairwise non-isomorphic graphs on t...
ABSTRACT. The maximum number of pairwise edge disjoint forests of order five in the complete graph K...
Abstract. A maximum packing of any k-fold complete multipartite graph (where there are k edges betwe...
Firstly, a graph G consists of a vertex set V (G), and an edge set E (G) of endpoints which relate t...
A directed graph is a way to encode information about directional relationships among objects. The c...
AbstractThe maximal number of pairwise edge disjoint graphs G of four vertices or less, in the compl...
In 2001, Erwin introduced broadcast domination in graphs. It is a variant of classical domination wh...
A 6-star is the complete bipartite graph $K_{1,6}$. A \emph{packing of $K_{n}$ with 6-stars} is a se...
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...
A total dominating set in a graph G is a set S of vertices of G such that every vertex in G is adjac...
Every connected graph folds onto some complete graph which is not necessarily unique. It is known th...