2021; Physical and Mathematical Sciences, 55(2 (255): 113–122
Shared with The Gufo

INTERVAL EDGE-COLORINGS OF TREES WITH RESTRICTIONS ON THE EDGES

Albert Sahakyan*

Received: 2025-01-27 · Published: 2021-08-30

© 2021 The Author(s) and the original publisher.

CC BY-NC 4.0 This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Shared article.
Original title
INTERVAL EDGE-COLORINGS OF TREES WITH RESTRICTIONS ON THE EDGES
Author
Albert Sahakyan
Published
2021-08-30
Licence
Creative Commons Attribution-NonCommercial 4.0 International
Original
https://doi.org/10.46991/PYSU:A/2021.55.2.113

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.
1 / ? 100% Open in new tab Download Cite

Loading the full text…

Download Follow Updates