Edge homogeneous colorings

IF 1 Q1 MATHEMATICS
T. Madaras, Alfréd Onderko, Thomas Schweser
{"title":"Edge homogeneous colorings","authors":"T. Madaras, Alfréd Onderko, Thomas Schweser","doi":"10.7494/opmath.2022.42.1.65","DOIUrl":null,"url":null,"abstract":"We explore four kinds of edge colorings defined by the requirement of equal number of colors appearing, in particular ways, around each vertex or each edge. We obtain the characterization of graphs colorable in such a way that the ends of each edge see (not regarding the edge color itself) \\(q\\) colors (resp. one end sees \\(q\\) colors and the color sets for both ends are the same), and a sufficient condition for 2-coloring a graph in a way that the ends of each edge see (with the omission of that edge color) altogether \\(q\\) colors. The relations of these colorings to \\(M_q\\)-colorings and role colorings are also discussed; we prove an interpolation theorem for the numbers of colors in edge coloring where all edges around each vertex have \\(q\\) colors.","PeriodicalId":45563,"journal":{"name":"Opuscula Mathematica","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Opuscula Mathematica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7494/opmath.2022.42.1.65","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

We explore four kinds of edge colorings defined by the requirement of equal number of colors appearing, in particular ways, around each vertex or each edge. We obtain the characterization of graphs colorable in such a way that the ends of each edge see (not regarding the edge color itself) \(q\) colors (resp. one end sees \(q\) colors and the color sets for both ends are the same), and a sufficient condition for 2-coloring a graph in a way that the ends of each edge see (with the omission of that edge color) altogether \(q\) colors. The relations of these colorings to \(M_q\)-colorings and role colorings are also discussed; we prove an interpolation theorem for the numbers of colors in edge coloring where all edges around each vertex have \(q\) colors.
边缘均匀着色
我们探索了四种边缘着色,这些着色要求在每个顶点或每个边周围以特定的方式出现相同数量的颜色。我们以这样一种方式获得了可着色图的特征,即每个边的末端看到(不考虑边的颜色本身)\(q\)颜色(参见。一端看到\(q\)颜色,两端的颜色集是相同的),以及以每条边的两端看到(省略该边的颜色)的方式对图形进行2着色的充分条件\(q\)颜色。讨论了这些着色剂与\(M_q\) -着色剂和作用着色剂的关系;我们证明了边着色中颜色数的插值定理,其中每个顶点周围的所有边都有\(q\)颜色。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Opuscula Mathematica
Opuscula Mathematica MATHEMATICS-
CiteScore
1.70
自引率
20.00%
发文量
30
审稿时长
22 weeks
×
引用
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学术官方微信