Disjoint properly colored cycles in edge-colored complete bipartite graphs

DOI10.1016/j.disc.2022.113095zbMath1502.05078OpenAlexW4292116863MaRDI QIDQ2092322

Kiyoshi Yoshimoto

Publication date: 2 November 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.113095

zbMATH Keywords

digraphscomplete bipartite graphsedge-colored graphsdisjoint cyclesproperly colored cyclesBermond and Thomassen's conjecture

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Disjoint cycles in digraphs
• Alternating cycles in edge-partitioned graphs
• A note on alternating cycles in edge-coloured graphs
• A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs
• Cycles in digraphs– a survey
• Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
• Local Anti-Ramsey Numbers of Graphs
• Vertex‐disjoint properly edge‐colored cycles in edge‐colored complete graphs
• A complete bipartite graph without properly colored cycles of length four
• Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments
• Digraphs
• Vertex-disjoint cycles in bipartite tournaments

This page was built for publication: Disjoint properly colored cycles in edge-colored complete bipartite graphs