Regular spanning subgraphs of bipartite graphs of high minimum degree.
Csaba, Béla (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Csaba, Béla (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jaroslav Ivančo, Tatiana Polláková (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we establish some conditions for graphs with a saturated vertex to be supermagic. Inter alia we show that complete multipartite graphs K1,n,n and K1,2,...,2 are supermagic.
M. Tavakoli, F. Rahbarnia, M. Mirzavaziri, A. R. Ashrafi, I. Gutman (2013)
Kragujevac Journal of Mathematics
Similarity:
H. S. Ramane, D. S. Revankar, I. Gutman, H. B. Walikar (2009)
Publications de l'Institut Mathématique
Similarity:
Exoo, Geoffrey, Jajcay, Robert (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hoffmann, Arne, Volkmann, Lutz (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Flaxman, Abraham D., Hoory, Shlomo (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jaroslav Ivančo, Tatiana Polláková (2012)
Mathematica Bohemica
Similarity:
A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise different (and consecutive) integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we characterize magic joins of graphs and we establish some conditions for magic joins of graphs to be supermagic.
Gliviak, Ferdinand, Kyš, P. (1997)
Acta Mathematica Universitatis Comenianae. New Series
Similarity: