It was not known about simple cycles

MaRDI QIDQ6232693zbMATH OpenFDO

Authors R. R. Kamalian

Publication date 1 May 2012

Abstract: A proper edge $t$-coloring of a graph is a coloring of its edges with colors $1,2,\mathrm{...},t$ such that all colors are used, and no two adjacent edges receive the same color. For any integer $ngeq3$, all possible values of $t$ are found, for which there exists such a proper edge $t$-coloring of the simple cycle C(n), which uses for each pair of adjacent edges either consecutive colors or the first and the last ones.

This page was built for publication: It was not known about simple cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6232693)