圆弧色完全二部有向图和完全二部有向图中的适当着色C4→s

IF 0.7 3区 数学 Q2 MATHEMATICS Discrete Mathematics Pub Date : 2025-04-01 Epub Date: 2024-12-17 DOI:10.1016/j.disc.2024.114367
Mengyu Duan , Binlong Li , Shenggui Zhang
{"title":"圆弧色完全二部有向图和完全二部有向图中的适当着色C4→s","authors":"Mengyu Duan ,&nbsp;Binlong Li ,&nbsp;Shenggui Zhang","doi":"10.1016/j.disc.2024.114367","DOIUrl":null,"url":null,"abstract":"<div><div>A subdigraph of an arc-colored digraph is called <em>properly colored</em> if its every consecutive arcs have distinct colors. Let <em>D</em> be a digraph. For a digraph <em>H</em>, let <span><math><mi>p</mi><mi>c</mi><mo>(</mo><mi>D</mi><mo>,</mo><mi>H</mi><mo>)</mo></math></span> be the minimum number such that every arc-colored digraph <span><math><msup><mrow><mi>D</mi></mrow><mrow><mi>C</mi></mrow></msup></math></span> with <span><math><mi>c</mi><mo>(</mo><mi>D</mi><mo>)</mo><mo>≥</mo><mi>p</mi><mi>c</mi><mo>(</mo><mi>D</mi><mo>,</mo><mi>H</mi><mo>)</mo></math></span> contains a properly colored copy of <em>H</em>, where <span><math><mi>c</mi><mo>(</mo><mi>D</mi><mo>)</mo></math></span> is the number of colors of <span><math><msup><mrow><mi>D</mi></mrow><mrow><mi>C</mi></mrow></msup></math></span>. Let <span><math><mover><mrow><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow><mrow><mo>↔</mo></mrow></mover></math></span> and <span><math><mover><mrow><msub><mrow><mi>K</mi></mrow><mrow><mi>m</mi><mo>,</mo><mi>n</mi></mrow></msub></mrow><mrow><mo>↔</mo></mrow></mover></math></span> be the digraphs obtained from the complete graph <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> and the complete bipartite graph <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>m</mi><mo>,</mo><mi>n</mi></mrow></msub></math></span> respectively by replacing each edge <em>uv</em> with a pair of symmetric arcs <span><math><mo>(</mo><mi>u</mi><mo>,</mo><mi>v</mi><mo>)</mo></math></span> and <span><math><mo>(</mo><mi>v</mi><mo>,</mo><mi>u</mi><mo>)</mo></math></span>; and let <span><math><mover><mrow><msub><mrow><mi>C</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow><mrow><mo>→</mo></mrow></mover></math></span> be the directed cycle of length <em>k</em>. In this paper we determine <span><math><mi>p</mi><mi>c</mi><mo>(</mo><mover><mrow><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow><mrow><mo>↔</mo></mrow></mover><mo>,</mo><mover><mrow><msub><mrow><mi>C</mi></mrow><mrow><mn>4</mn></mrow></msub></mrow><mrow><mo>→</mo></mrow></mover><mo>)</mo></math></span>, <span><math><mi>p</mi><mi>c</mi><mo>(</mo><mover><mrow><msub><mrow><mi>K</mi></mrow><mrow><mi>m</mi><mo>,</mo><mi>n</mi></mrow></msub></mrow><mrow><mo>↔</mo></mrow></mover><mo>,</mo><mover><mrow><msub><mrow><mi>C</mi></mrow><mrow><mn>4</mn></mrow></msub></mrow><mrow><mo>→</mo></mrow></mover><mo>)</mo></math></span> and characterize the corresponding extremal arc-colorings of digraphs.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 4","pages":"Article 114367"},"PeriodicalIF":0.7000,"publicationDate":"2025-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Properly colored C4→'s in arc-colored complete and complete bipartite digraphs\",\"authors\":\"Mengyu Duan ,&nbsp;Binlong Li ,&nbsp;Shenggui Zhang\",\"doi\":\"10.1016/j.disc.2024.114367\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>A subdigraph of an arc-colored digraph is called <em>properly colored</em> if its every consecutive arcs have distinct colors. Let <em>D</em> be a digraph. For a digraph <em>H</em>, let <span><math><mi>p</mi><mi>c</mi><mo>(</mo><mi>D</mi><mo>,</mo><mi>H</mi><mo>)</mo></math></span> be the minimum number such that every arc-colored digraph <span><math><msup><mrow><mi>D</mi></mrow><mrow><mi>C</mi></mrow></msup></math></span> with <span><math><mi>c</mi><mo>(</mo><mi>D</mi><mo>)</mo><mo>≥</mo><mi>p</mi><mi>c</mi><mo>(</mo><mi>D</mi><mo>,</mo><mi>H</mi><mo>)</mo></math></span> contains a properly colored copy of <em>H</em>, where <span><math><mi>c</mi><mo>(</mo><mi>D</mi><mo>)</mo></math></span> is the number of colors of <span><math><msup><mrow><mi>D</mi></mrow><mrow><mi>C</mi></mrow></msup></math></span>. Let <span><math><mover><mrow><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow><mrow><mo>↔</mo></mrow></mover></math></span> and <span><math><mover><mrow><msub><mrow><mi>K</mi></mrow><mrow><mi>m</mi><mo>,</mo><mi>n</mi></mrow></msub></mrow><mrow><mo>↔</mo></mrow></mover></math></span> be the digraphs obtained from the complete graph <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> and the complete bipartite graph <span><math><msub><mrow><mi>K</mi></mrow><mrow><mi>m</mi><mo>,</mo><mi>n</mi></mrow></msub></math></span> respectively by replacing each edge <em>uv</em> with a pair of symmetric arcs <span><math><mo>(</mo><mi>u</mi><mo>,</mo><mi>v</mi><mo>)</mo></math></span> and <span><math><mo>(</mo><mi>v</mi><mo>,</mo><mi>u</mi><mo>)</mo></math></span>; and let <span><math><mover><mrow><msub><mrow><mi>C</mi></mrow><mrow><mi>k</mi></mrow></msub></mrow><mrow><mo>→</mo></mrow></mover></math></span> be the directed cycle of length <em>k</em>. In this paper we determine <span><math><mi>p</mi><mi>c</mi><mo>(</mo><mover><mrow><msub><mrow><mi>K</mi></mrow><mrow><mi>n</mi></mrow></msub></mrow><mrow><mo>↔</mo></mrow></mover><mo>,</mo><mover><mrow><msub><mrow><mi>C</mi></mrow><mrow><mn>4</mn></mrow></msub></mrow><mrow><mo>→</mo></mrow></mover><mo>)</mo></math></span>, <span><math><mi>p</mi><mi>c</mi><mo>(</mo><mover><mrow><msub><mrow><mi>K</mi></mrow><mrow><mi>m</mi><mo>,</mo><mi>n</mi></mrow></msub></mrow><mrow><mo>↔</mo></mrow></mover><mo>,</mo><mover><mrow><msub><mrow><mi>C</mi></mrow><mrow><mn>4</mn></mrow></msub></mrow><mrow><mo>→</mo></mrow></mover><mo>)</mo></math></span> and characterize the corresponding extremal arc-colorings of digraphs.</div></div>\",\"PeriodicalId\":50572,\"journal\":{\"name\":\"Discrete Mathematics\",\"volume\":\"348 4\",\"pages\":\"Article 114367\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2025-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0012365X24004989\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2024/12/17 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X24004989","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/12/17 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

如果一个有向图的每个连续的弧都有不同的颜色,那么它的子图就被称为有向图。设D是有向图。对于有向图H,设pc(D,H)为满足每个c(D)≥pc(D,H)的弧色有向图DC包含H的适当彩色副本的最小值,其中c(D)为DC的颜色数。设Kn↔和Km,n↔分别是由完全图Kn和完全二部图Km,n通过用一对对称弧(u,v)和(v,u)代替每条边uv得到的有向图;并设Ck→为长度为k的有向循环。本文确定了pc(Kn↔,C4→)、pc(Km,n↔,C4→)并描述了有向图的相应的极值弧着色。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Properly colored C4→'s in arc-colored complete and complete bipartite digraphs
A subdigraph of an arc-colored digraph is called properly colored if its every consecutive arcs have distinct colors. Let D be a digraph. For a digraph H, let pc(D,H) be the minimum number such that every arc-colored digraph DC with c(D)pc(D,H) contains a properly colored copy of H, where c(D) is the number of colors of DC. Let Kn and Km,n be the digraphs obtained from the complete graph Kn and the complete bipartite graph Km,n respectively by replacing each edge uv with a pair of symmetric arcs (u,v) and (v,u); and let Ck be the directed cycle of length k. In this paper we determine pc(Kn,C4), pc(Km,n,C4) and characterize the corresponding extremal arc-colorings of digraphs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Discrete Mathematics
Discrete Mathematics 数学-数学
CiteScore
1.50
自引率
12.50%
发文量
424
审稿时长
6 months
期刊介绍: Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.
期刊最新文献
Generator matrices of quasi-cyclic codes New constant dimension subspace codes by multilevel and parallel linkage constructions 3AP-free permutations have no exponential growth rate Squares of subcubic planar graphs without cycles of length 4–8 are 6-choosable On the totally positive matrices related to refined Eulerian numbers
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1