Disjoint properly colored cycles in edge-colored complete bipartite graphs
type: Item
instance of: scholarly article
title: Disjoint properly colored cycles in edge-colored complete bipartite graphs
zbMATH Open document ID: 1502.05078
author: Kiyoshi Yoshimoto
published in: Discrete Mathematics
publication date: 2022-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 7611166
zbMATH Keywords: edge-colored graphs
zbMATH Keywords: complete bipartite graphs
zbMATH Keywords: digraphs
zbMATH Keywords: Bermond and Thomassen's conjecture
zbMATH Keywords: disjoint cycles
zbMATH Keywords: properly colored cycles
MaRDI profile type: Publication
full work available at URL: j.disc.2022.113095
OpenAlex ID: W4292116863
cites work: Local Anti-Ramsey Numbers of Graphs
cites work: Vertex-disjoint cycles in bipartite tournaments
cites work: Digraphs
cites work: Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments
cites work: Cycles in digraphs– a survey
cites work: A complete bipartite graph without properly colored cycles of length four
cites work: Q3139750
cites work: Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
cites work: Alternating cycles in edge-partitioned graphs
cites work: Vertex‐disjoint properly edge‐colored cycles in edge‐colored complete graphs
cites work: A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs
cites work: Disjoint cycles in digraphs
cites work: A note on alternating cycles in edge-coloured graphs
DOI: 10.1016/J.DISC.2022.113095
description: scientific article; zbMATH DE number 7611166