Edge Colorings of K(m,n) with m+n-1 Colors Which Forbid Rainbow Cycles

DOI10.20429/tag.2017.040101zbMath1416.05109OpenAlexW2583929849MaRDI QIDQ5225529

Claire Zhang, Peter D. jun. Johnson

Publication date: 22 July 2019

Published in: Theory and Application of Graphs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.20429/tag.2017.040101

zbMATH Keywords

vertex labelings of full binary trees with $m+n$ leafs

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

On rainbow-cycle-forbidding edge colorings of finite graphs

This page was built for publication: Edge Colorings of K(m,n) with m+n-1 Colors Which Forbid Rainbow Cycles