QP-2015-03

Regular graphs are antimagic

Kristóf Bérczi, Attila Bernáth, Máté Vizer

In this note we prove - with a slight modification of an argument of Cranston et al. \cite{cranston} - that $k$-regular graphs are antimagic for $k\ge 2$.

Bibtex entry:

@techreport{egresqp-15-03,

AUTHOR	=	{B{\'e}rczi, Krist{\'o}f and Bern{\'a}th, Attila and Vizer, M{\'a}t{\'e}},
TITLE	=	{Regular graphs are antimagic},
NOTE	=	{{\tt egres.elte.hu}},
INSTITUTION	=	{Egerv{\'a}ry Research Group, Budapest},
YEAR	=	{2015},
NUMBER	=	{QP-2015-03}

}