INTERVAL EDGE-COLORINGS OF TREES WITH RESTRICTIONS ON THE EDGES

Albert Kh. Sahakyan, Rafayel R. Kamalian
{"title":"INTERVAL EDGE-COLORINGS OF TREES WITH RESTRICTIONS ON THE EDGES","authors":"Albert Kh. Sahakyan, Rafayel R. Kamalian","doi":"10.46991/pysu:a/2021.55.2.113","DOIUrl":null,"url":null,"abstract":"An edge-coloring of a graph $G$ with consecutive integers $c_1,\\ldots,c_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. 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.","PeriodicalId":21146,"journal":{"name":"Proceedings of the YSU A: Physical and Mathematical Sciences","volume":"109 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the YSU A: Physical and Mathematical Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46991/pysu:a/2021.55.2.113","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

An edge-coloring of a graph $G$ with consecutive integers $c_1,\ldots,c_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. 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.
在边缘上有限制的树的区间边着色
具有连续整数$c_1,\ldots,c_t$的图$G$的边着色称为区间t着色,如果使用所有的颜色,并且与$G$的任意顶点相关的边的颜色是不同的,并且形成一个整数区间。一个图$G$是区间可着色的,如果它对某个正整数$t$具有区间t着色。在本文中,我们考虑了树的边缘存在限制的情况,并提供了一个多项式算法来检验满足这些限制的区间可着色性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信