AbstractIn this paper we prove that the complete symmetric directed graph with n vertices K∗n can be decomposed into directed circuits of length k, where k is an odd integer, if n ≡ 0 or 1 (mod k) and n ⩾ k
AbstractWe establish necessary and sufficient conditions for decomposing the complete graph of even ...
AbstractThe circuit polynomial of the complete graph K1 is used to deduce results about node disjoin...
AbstractLet Cm[K¯2] stand for a cycle Cm in which every vertex is replaced by two isolated vertices ...
AbstractIn this paper we prove that the complete symmetric directed graph with n vertices K∗n can be...
AbstractWe study the decomposition of Kn∗ (the complete directed graph with n vertices) into arc-dis...
AbstractWe establish necessary and sufficient conditions for decomposing the complete symmetric digr...
AbstractIn this paper we give necessary and sufficient conditions in order that Km,n (Km,n∗) admits ...
We show that the complete graph on n vertices can be decomposed into t cycles of specified lengths m...
AbstractWe show that if Kn−I, the complete graph on n vertices with a 1-factor removed, can be decom...
In this paper we investigate decompositions of a complete bipartite symmetric multidigraph λKm,n* an...
AbstractLet m1,m2,…,mt be a list of integers. It is shown that there exists an integer N such that f...
AbstractLet G be a cubic graph of order 2n consisting of a cycle plus a perfect matching and let G∗ ...
AbstractValues of t, x, and m are obtained for which the complete multipartite graph defined by t in...
AbstractIn this paper we show that the complete equipartite graph with n parts, each of size 2k, dec...
AbstractLet K(n;r) denote the complete r-partite graph K(n, n,…, n). It is shown here that for all e...
AbstractWe establish necessary and sufficient conditions for decomposing the complete graph of even ...
AbstractThe circuit polynomial of the complete graph K1 is used to deduce results about node disjoin...
AbstractLet Cm[K¯2] stand for a cycle Cm in which every vertex is replaced by two isolated vertices ...
AbstractIn this paper we prove that the complete symmetric directed graph with n vertices K∗n can be...
AbstractWe study the decomposition of Kn∗ (the complete directed graph with n vertices) into arc-dis...
AbstractWe establish necessary and sufficient conditions for decomposing the complete symmetric digr...
AbstractIn this paper we give necessary and sufficient conditions in order that Km,n (Km,n∗) admits ...
We show that the complete graph on n vertices can be decomposed into t cycles of specified lengths m...
AbstractWe show that if Kn−I, the complete graph on n vertices with a 1-factor removed, can be decom...
In this paper we investigate decompositions of a complete bipartite symmetric multidigraph λKm,n* an...
AbstractLet m1,m2,…,mt be a list of integers. It is shown that there exists an integer N such that f...
AbstractLet G be a cubic graph of order 2n consisting of a cycle plus a perfect matching and let G∗ ...
AbstractValues of t, x, and m are obtained for which the complete multipartite graph defined by t in...
AbstractIn this paper we show that the complete equipartite graph with n parts, each of size 2k, dec...
AbstractLet K(n;r) denote the complete r-partite graph K(n, n,…, n). It is shown here that for all e...
AbstractWe establish necessary and sufficient conditions for decomposing the complete graph of even ...
AbstractThe circuit polynomial of the complete graph K1 is used to deduce results about node disjoin...
AbstractLet Cm[K¯2] stand for a cycle Cm in which every vertex is replaced by two isolated vertices ...
DOI
Add to ORKG