On Interval Non-Edge-Colorable Eulerian Multigraphs
Combinatorics
2013-11-19 v2 Discrete Mathematics
Abstract
An edge-coloring of a multigraph with colors is called an interval -coloring if all colors are used, and the colors of edges incident to any vertex of 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.
Cite
@article{arxiv.1311.2210,
title = {On Interval Non-Edge-Colorable Eulerian Multigraphs},
author = {Petros A. Petrosyan},
journal= {arXiv preprint arXiv:1311.2210},
year = {2013}
}
Comments
4 pages