AbstractLet H and G be two graphs. The concept of an H-supermagic decomposition of G arises from the marriage between graph labelings and graph decompositions. In this paper, we give the conditions for the existence of C2k-supermagic decomposition of the complete n-partite graph as well as of multiple copies of it
This paper surveys results on cycle decompositions of complete multipartite graphs (where the parts ...
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
AbstractA graph H is called a supersubdivison of a graph G if H is obtained from G by replacing ever...
AbstractLet H and G be two graphs. The concept of an H-supermagic decomposition of G arises from the...
Let H and G be two simple graphs. The concept of an H-magic decomposition of G arises from the combi...
AbstractA simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomo...
An H-magic labeling in an H-decomposable graph G is a bijection f:V(G) U E(G) --> {1,2, … ,p+q} s...
A simple graph G = (V,E) admits an H-covering if every edge in E belongs to a subgraph of G isomorph...
Let H be a graph. A graph G = (V,E) is said to be H-magic if every edge of G belongs to at least one...
AbstractA graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic t...
AbstractA decomposition of a graph G into isomorphic copies of a graph H is H-magic if there is a bi...
AbstractA simple graph G=(V,E) admits a cycle-covering if every edge in E belongs at least to one su...
<p>An H-magic labeling in an H-decomposable graph G is a bijection f:V(G) U E(G) --> {1,2, … ,p+q...
An H-decomposition of a graph G is a partition of the edges of G into subsets, each of which induces...
A simple graph G=(V,E) admits an H covering if every edge in E belongs to a subgraph of G isomorphic...
This paper surveys results on cycle decompositions of complete multipartite graphs (where the parts ...
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
AbstractA graph H is called a supersubdivison of a graph G if H is obtained from G by replacing ever...
AbstractLet H and G be two graphs. The concept of an H-supermagic decomposition of G arises from the...
Let H and G be two simple graphs. The concept of an H-magic decomposition of G arises from the combi...
AbstractA simple graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomo...
An H-magic labeling in an H-decomposable graph G is a bijection f:V(G) U E(G) --> {1,2, … ,p+q} s...
A simple graph G = (V,E) admits an H-covering if every edge in E belongs to a subgraph of G isomorph...
Let H be a graph. A graph G = (V,E) is said to be H-magic if every edge of G belongs to at least one...
AbstractA graph G admits an H-covering if every edge in E(G) belongs to a subgraph of G isomorphic t...
AbstractA decomposition of a graph G into isomorphic copies of a graph H is H-magic if there is a bi...
AbstractA simple graph G=(V,E) admits a cycle-covering if every edge in E belongs at least to one su...
<p>An H-magic labeling in an H-decomposable graph G is a bijection f:V(G) U E(G) --> {1,2, … ,p+q...
An H-decomposition of a graph G is a partition of the edges of G into subsets, each of which induces...
A simple graph G=(V,E) admits an H covering if every edge in E belongs to a subgraph of G isomorphic...
This paper surveys results on cycle decompositions of complete multipartite graphs (where the parts ...
Let G = (V, E) be a graph with n vertices and e edges. A supermagic labeling of G is a bijection f f...
AbstractA graph H is called a supersubdivison of a graph G if H is obtained from G by replacing ever...
DOI
Add to ORKG