pith. sign in

arxiv: 1311.2210 · v2 · pith:NEIOYYNWnew · submitted 2013-11-09 · 🧮 math.CO · cs.DM

On Interval Non-Edge-Colorable Eulerian Multigraphs

classification 🧮 math.CO cs.DM
keywords intervalcolorseulerianmultigraphscoloringedgesnon-edge-colorablecalled
0
0 comments X
read the original abstract

An edge-coloring of a multigraph $G$ with colors $1,\ldots,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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.