Add to ORKGAn arc colored eulerian multidigraph with l colors is rainbow eulerian if there is an eulerian circuit in which a sequence of l colors repeats. The digraph product that refers the title was introduced by Figueroa-Centeno et al. as follows: let D be a digraph and let G be a family of digraphs such that V (F) = V for every F ¿ GPostprint (published version
In this paper, we use the product ⊗h in order to study super edge-magic labelings, bi-magic labeling...
AbstractA trigraph is a multigraph with half-edges colored in three colors. We introduce the notion ...
1. Dicycle cover of Hamiltonian oriented graphs. A dicycle cover of a digraph D is a family F of dic...
An arc colored eulerian multidigraph with l colors is rainbow eulerian if there is an eulerian circu...
The ⊗h-product was introduced in 2008 by Figueroa-Centeno et al. as a way to construct new families ...
In this paper we study the edge-magicness of graphs with equal size and order, and we use such graph...
The -product that is referred in the title was introduced in 2008 as a generalization of the Kroneck...
A subgraph of an edge-coloured graph is called rainbow if all its edges have different colours. The ...
AbstractThe ⊗h-product was introduced in 2008 by Figueroa-Centeno et al. [15] as a way to construct ...
A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. The s...
AbstractWe1999 Academic Pressanalyze the freedom one has when constructing an Euler cycle throughCop...
AbstractIn this note we give an elementary combinatorial proof of a formula of Macris and Pulé for t...
Kotzig and Rosa defined in 1970 the concept of edge-magic labelings as follows: let G be a simple (p...
The ¿h-product that is referred in the title was introduced in 2008 as a generalization of the Krone...
Gallian's survey shows that there is a big variety of labelings of graphs. By means of (di)graphs pr...
In this paper, we use the product ⊗h in order to study super edge-magic labelings, bi-magic labeling...
AbstractA trigraph is a multigraph with half-edges colored in three colors. We introduce the notion ...
1. Dicycle cover of Hamiltonian oriented graphs. A dicycle cover of a digraph D is a family F of dic...
An arc colored eulerian multidigraph with l colors is rainbow eulerian if there is an eulerian circu...
The ⊗h-product was introduced in 2008 by Figueroa-Centeno et al. as a way to construct new families ...
In this paper we study the edge-magicness of graphs with equal size and order, and we use such graph...
The -product that is referred in the title was introduced in 2008 as a generalization of the Kroneck...
A subgraph of an edge-coloured graph is called rainbow if all its edges have different colours. The ...
AbstractThe ⊗h-product was introduced in 2008 by Figueroa-Centeno et al. [15] as a way to construct ...
A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. The s...
AbstractWe1999 Academic Pressanalyze the freedom one has when constructing an Euler cycle throughCop...
AbstractIn this note we give an elementary combinatorial proof of a formula of Macris and Pulé for t...
Kotzig and Rosa defined in 1970 the concept of edge-magic labelings as follows: let G be a simple (p...
The ¿h-product that is referred in the title was introduced in 2008 as a generalization of the Krone...
Gallian's survey shows that there is a big variety of labelings of graphs. By means of (di)graphs pr...
In this paper, we use the product ⊗h in order to study super edge-magic labelings, bi-magic labeling...
AbstractA trigraph is a multigraph with half-edges colored in three colors. We introduce the notion ...
1. Dicycle cover of Hamiltonian oriented graphs. A dicycle cover of a digraph D is a family F of dic...