English

On interval edge-colorings of bipartite graphs of small order

Discrete Mathematics 2016-04-01 v1 Combinatorics

Abstract

An edge-coloring of a graph GG with colors 1,,t1,\ldots,t is an interval tt-coloring if all colors are used, and the colors of edges incident to each vertex of GG are distinct and form an interval of integers. A graph GG is interval colorable if it has an interval tt-coloring for some positive integer tt. The problem of deciding whether a bipartite graph is interval colorable is NP-complete. The smallest known examples of interval non-colorable bipartite graphs have 1919 vertices. On the other hand it is known that the bipartite graphs on at most 1414 vertices are interval colorable. In this work we observe that several classes of bipartite graphs of small order have an interval coloring. In particular, we show that all bipartite graphs on 1515 vertices are interval colorable.

Keywords

Cite

@article{arxiv.1508.02851,
  title  = {On interval edge-colorings of bipartite graphs of small order},
  author = {Hrant Khachatrian and Tigran Mamikonyan},
  journal= {arXiv preprint arXiv:1508.02851},
  year   = {2016}
}

Comments

Accepted for the CSIT 2015 conference