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

DOI10.20429/TAG.2017.040101zbMATH Open1416.05109OpenAlexW2583929849MaRDI QIDQ5225529FDOQ5225529

Authors: Claire Zhang, P. 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

Recommendations

• scientific article; zbMATH DE number 5995288
• Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles
• On rainbow-cycle-forbidding edge colorings of finite graphs
• Edge-colorings of \(K_{m,n}\) which forbid multicolored cycles
• On colorings avoiding a rainbow cycle and a fixed monochromatic subgraph

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (7)

• Title not available (Why is that?)
• Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles
• On rainbow-cycle-forbidding edge colorings of finite graphs
• Proper rainbow-cycle-forbidding edge colorings of graphs
• Edge-colorings of \(K_{m,n}\) which forbid multicolored cycles
• On colorings avoiding a rainbow cycle and a fixed monochromatic subgraph
• Edge-colourings of \(K_{n,n}\) with no long two-coloured cycles

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

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