AbstractLet Sk denote the star with k edges. A balanced Sk-decomposition of a multigraph G is a family D of subgraphs of G whose edge sets form a partition of the edge set of G such that each member of D is isomorphic to Sk, and every vertex of G belongs to the same number of members in D. In this paper, we obtain the following results:(1)A necessary and sufficient condition for an r-regular multigraph to have a balanced Sk-decomposition.(2)A necessary and sufficient condition for the λ-fold complete bipartite graph λKm,n to have a balanced Sk-decomposition
The multistar $ S^{w_1,...,w_n}$ is the multigraph whose underlying graph is an $n$-star and the mul...
AbstractThere are simple arithmetic conditions necessary for the complete bipartite graph Km,n to ha...
AbstractFor a given integer k≥2, a balanced k-coloring of a graph G is a mapping c:V(G)→{0,1,2,…,k} ...
AbstractLet Sk denote the star with k edges. A balanced Sk-decomposition of a multigraph G is a fami...
AbstractIn this paper, we obtain a criterion for the decomposition of the λ-fold balanced complete b...
AbstractIn this paper, we obtain a criterion for the decomposition of the λ-fold balanced complete b...
AbstractA necessary and sufficient condition for the existence of a decomposition of λKv into stars ...
Let Pk+1 denote a path of length k, Sm denote a star with m edges, and Kn(λ) denote the complete mul...
AbstractFor a given integer k≥2, a balanced k-coloring of a graph G is a mapping c:V(G)→{0,1,2,…,k} ...
AbstractAn (s,t)-directed star decomposition of a directed multigraph is a partition of the ars into...
[[abstract]]For a given integer , a balanced-coloring of a graph is a mapping such that for , whe...
AbstractWe study the decomposition of multigraphs with a constant edge multiplicity into copies of a...
Let k be a positive integer, Sk and Ck denote, respectively, a star and a cycle of k edges. λKn is t...
AbstractA balanced vertex-coloring of a graph G is a function c from V(G) to {−1,0,1} such that ∑{c(...
Let P_k denote a path on k vertices, and let S_k denote a star with k edges. For graphs F, G, and H,...
The multistar $ S^{w_1,...,w_n}$ is the multigraph whose underlying graph is an $n$-star and the mul...
AbstractThere are simple arithmetic conditions necessary for the complete bipartite graph Km,n to ha...
AbstractFor a given integer k≥2, a balanced k-coloring of a graph G is a mapping c:V(G)→{0,1,2,…,k} ...
AbstractLet Sk denote the star with k edges. A balanced Sk-decomposition of a multigraph G is a fami...
AbstractIn this paper, we obtain a criterion for the decomposition of the λ-fold balanced complete b...
AbstractIn this paper, we obtain a criterion for the decomposition of the λ-fold balanced complete b...
AbstractA necessary and sufficient condition for the existence of a decomposition of λKv into stars ...
Let Pk+1 denote a path of length k, Sm denote a star with m edges, and Kn(λ) denote the complete mul...
AbstractFor a given integer k≥2, a balanced k-coloring of a graph G is a mapping c:V(G)→{0,1,2,…,k} ...
AbstractAn (s,t)-directed star decomposition of a directed multigraph is a partition of the ars into...
[[abstract]]For a given integer , a balanced-coloring of a graph is a mapping such that for , whe...
AbstractWe study the decomposition of multigraphs with a constant edge multiplicity into copies of a...
Let k be a positive integer, Sk and Ck denote, respectively, a star and a cycle of k edges. λKn is t...
AbstractA balanced vertex-coloring of a graph G is a function c from V(G) to {−1,0,1} such that ∑{c(...
Let P_k denote a path on k vertices, and let S_k denote a star with k edges. For graphs F, G, and H,...
The multistar $ S^{w_1,...,w_n}$ is the multigraph whose underlying graph is an $n$-star and the mul...
AbstractThere are simple arithmetic conditions necessary for the complete bipartite graph Km,n to ha...
AbstractFor a given integer k≥2, a balanced k-coloring of a graph G is a mapping c:V(G)→{0,1,2,…,k} ...