Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles

DOI10.20429/TAG.2017.040202zbMATH Open1416.05108OpenAlexW2770486912WikidataQ129114748 ScholiaQ129114748MaRDI QIDQ5225536FDOQ5225536

Authors: Andrew Owens, P. D. jun. Johnson 

Publication date: 22 July 2019

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

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

Recommendations

• scientific article; zbMATH DE number 5995288
• On rainbow-cycle-forbidding edge colorings of finite graphs
• Edge Colorings of K(m,n) with m+n-1 Colors Which Forbid Rainbow Cycles
• Complete graphs with no rainbow tree
• On rainbow trees and cycles

zbMATH Keywords

Huffman labelingrainbow-cycle-forbidding edge colorings

Mathematics Subject Classification ID

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

Cited In (5)

• Edge Colorings of K(m,n) with m+n-1 Colors Which Forbid Rainbow Cycles
• Title not available (Why is that?)
• On rainbow-cycle-forbidding edge colorings of finite graphs
• Proper rainbow-cycle-forbidding edge colorings of graphs
• On sufficient conditions for rainbow cycles in edge-colored graphs

This page was built for publication: Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5225536)