Properly colored C4→'s in arc-colored complete and complete bipartite digraphs

Mengyu Duan, Binlong Li, Shenggui Zhang

科研成果: 期刊稿件文章同行评审

2 引用 (Scopus)

摘要

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.

源语言英语
文章编号114367
期刊Discrete Mathematics
348
4
DOI
出版状态已出版 - 4月 2025

指纹

探究 'Properly colored C4→'s in arc-colored complete and complete bipartite digraphs' 的科研主题。它们共同构成独一无二的指纹。

引用此