Edge-colorings of $K_{m,n}$ which Forbid Multicolored Cycles

zbMath1286.05046arXiv1407.0043MaRDI QIDQ2848790

Yuan-Hsun Lo, Ryo-Yu Pei, Hung-Lin Fu

Publication date: 26 September 2013

Full work available at URL: https://arxiv.org/abs/1407.0043

zbMATH Keywords

edge coloringcomplete bipartite graphmulticolored cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

This page was built for publication: Edge-colorings of $K_{m,n}$ which Forbid Multicolored Cycles