Rainbow matchings in -partite -graphs.
Aharoni, Ron, Berger, Eli (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Aharoni, Ron, Berger, Eli (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A. Raheem, M. Javaid, A.Q. Baig (2015)
Discussiones Mathematicae Graph Theory
Similarity:
Enomoto, Llado, Nakamigawa and Ringel (1998) defined the concept of a super (a, 0)-edge-antimagic total labeling and proposed the conjecture that every tree is a super (a, 0)-edge-antimagic total graph. In the support of this conjecture, the present paper deals with different results on super (a, d)-edge-antimagic total labeling of subdivided stars for d ∈ {0, 1, 2, 3}.
Wieland, Benjamin (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Pavel Tomasta (1982)
Mathematica Slovaca
Similarity:
Caselli, F., Krattenthaler, C., Lass, B., Nadeau, P. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kostochka, Alexandr V., Stiebitz, Michael (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rosta, Vera (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Piguet, Diana, Stein, Maya Jakobine (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Alon, Noga, Ruszinkó, Miklós (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Greenhill, Catherine, Ruciński, Andrzej (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Loebl, Martin (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Wierman, John C., Ziff, Robert M. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sana Javed, Mujtaba Hussain, Ayesha Riasat, Salma Kanwal, Mariam Imtiaz, M. O. Ahmad (2017)
Open Mathematics
Similarity:
An edge-magic total labeling of an (n,m)-graph G = (V,E) is a one to one map λ from V(G) ∪ E(G) onto the integers {1,2,…,n + m} with the property that there exists an integer constant c such that λ(x) + λ(y) + λ(xy) = c for any xy ∈ E(G). It is called super edge-magic total labeling if λ (V(G)) = {1,2,…,n}. Furthermore, if G has no super edge-magic total labeling, then the minimum number of vertices added to G to have a super edge-magic total labeling, called super edge-magic deficiency...