On the Hartsfield–Ringel hypothesis: connected unigraphs
Trudy Instituta matematiki, Tome 22 (2014) no. 2, pp. 46-52
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
The Hartsfield–Ringel hypothesis about the antimagicness of connected graphs is investigated in the class of connected unigraphs. It is proven that all connected unigraphs with no less than three vertices are antimagic.
[1] Hartsfield N., Ringel G., Pearls in Graph Theory, Academic Press, Inc., Boston, 1990 ; revised version, 1994 | MR | Zbl
[2] Tyshkevich R. I., “Decomposition of graphical sequences and unigraphs”, Discrete Mathematics, 220 (2000), 201–238 | DOI | MR | Zbl
[3] Barrus M. D., “Antimagic labeling and canonical decomposition of graphs”, Information Processing Letters Journal, 110 (2010), 261–263 | DOI | MR | Zbl
[4] Alon N., Kaplan G., Lev A., Roditty Y., Yuster R., “Dense graphs are antimagic”, J. of Graph Theory, 47 (2004), 297–309 | DOI | MR | Zbl