Path systems in acyclic directed graphs
H. D. O. F. Gronau, W. Just, W. Schade, Petra Scheffler, J. Wojciechowski (1987)
Applicationes Mathematicae
Similarity:
H. D. O. F. Gronau, W. Just, W. Schade, Petra Scheffler, J. Wojciechowski (1987)
Applicationes Mathematicae
Similarity:
Bretto, A. (1999)
Southwest Journal of Pure and Applied Mathematics [electronic only]
Similarity:
Zdzisław Skupień (2007)
Discussiones Mathematicae Graph Theory
Similarity:
W. Wessel (1987)
Applicationes Mathematicae
Similarity:
Risto Šokarovski (1977)
Publications de l'Institut Mathématique
Similarity:
Gary Chartrand, Hudson V. Kronk, Seymour Schuster (1973)
Colloquium Mathematicae
Similarity:
S. F. Kapoor, Linda M. Lesniak (1976)
Colloquium Mathematicae
Similarity:
Lynch, Christopher, Strogova Polina (1998)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Jaroslav Ivančo (2016)
Discussiones Mathematicae Graph Theory
Similarity:
A graph G is called supermagic if it admits a labelling of the edges by pairwise di erent 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 will introduce some constructions of supermagic labellings of some graphs generalizing double graphs. Inter alia we show that the double graphs of regular Hamiltonian graphs and some circulant graphs are supermagic.