INTERVAL EDGE-COLORINGS OF TREES WITH RESTRICTIONS ON THE EDGES

Albert Sahakyan

This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

This work is licensed under Creative Commons Attribution–NonCommercial International License (CC BY-NC 4.0).

Abstract

An edge-coloring of a graph G with consecutive integers c1,…,ct 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. A graph G is interval colorable, if it has an interval t-coloring for some positive integer t. In this paper, we consider the case, where there are restrictions on the edges of the tree and provide a polynomial algorithm for checking interval colorability that satisfies those restrictions.

Author(s)

Table of Contents

INTERVAL EDGE-COLORINGS OF TREES WITH RESTRICTIONS ON THE EDGES

Abstract

Author(s)

Table of Contents

Related Articles

ON UNIQUENESS OF HOLOMORPHIC AND BOUNDED OUTSIDE THE CLOSED LOGARITHMIC SECTOR FUNCTIONS REPRESENTABLE BY LACUNARY POWER SERIES

COMPUTER DETECTING AND PROCESSING OF THE SIGNALS OF A FLAT-COIL ABSOLUTE-POSITION SENSOR BASED SEISMIC DETECTOR

INTERVAL EDGE-COLORINGS OF TREES WITH RESTRICTIONS ON THE EDGES

Abstract

Subscribe to TheGufo Newsletter​

Subscribe to TheGufo Newsletter