On Interval Non-Edge-Colorable Eulerian Multigraphs

Abstract

An edge-coloring of a multigraph $G$ with colors $1,\dots ,t$ is called an interval $t$-coloring if all colors are used, and the colors of edges incident to any vertex of $G$ are distinct and form an interval of integers. In this note, we show that all Eulerian multigraphs with an odd number of edges have no interval coloring. We also give some methods for constructing of interval non-edge-colorable Eulerian multigraphs.

4 pages

References in corpus (1)

• Interval colorings of edges of a multigraph