A complete bipartite graph without properly colored cycles of length four

DOI10.1002/jgt.22480zbMath1495.05088OpenAlexW2959852710MaRDI QIDQ5110650

Kenta Ozeki, Kiyoshi Yoshimoto, Roman Čada

Publication date: 21 May 2020

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22480

zbMATH Keywords

complete bipartite graphproperly colored cycleminimum color degree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Edge‐colored complete graphs without properly colored even cycles: A full characterization ⋮ A classification of edge-colored graphs based on properly colored walks ⋮ Edge-colored complete graphs containing no properly colored odd cycles ⋮ Disjoint properly colored cycles in edge-colored complete bipartite graphs ⋮ On connectivities of edge-colored graphs ⋮ Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs

This page was built for publication: A complete bipartite graph without properly colored cycles of length four