On rainbow-cycle-forbidding edge colorings of finite graphs

DOI10.1007/s00373-019-02102-6zbMath1431.05068OpenAlexW2978389938WikidataQ127179719 ScholiaQ127179719MaRDI QIDQ2287749

D. G. Hoffman, Andrew Owens, Peter D. jun. Johnson, Paul S. Horn

Publication date: 21 January 2020

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-019-02102-6

zbMATH Keywords

edge coloringedge cutrainbow-cycle-forbidding

Mathematics Subject Classification ID

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

Related Items (4)

Rainbow and monochromatic circuits and cocircuits in binary matroids ⋮ Unnamed Item ⋮ Rainbow Odd Cycles ⋮ Edge-colored complete graphs containing no properly colored odd cycles

Cites Work

• Unnamed Item
• Rainbow generalizations of Ramsey theory: A survey
• Bipartite decomposition of random graphs
• More on the Bipartite Decomposition of Random Graphs
• Rainbow faces in edge‐colored plane graphs
• Edge Colorings of K(m,n) with m+n-1 Colors Which Forbid Rainbow Cycles
• Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles
• On the Addressing Problem for Loop Switching
• Decomposition of Random Graphs into Complete Bipartite Graphs

This page was built for publication: On rainbow-cycle-forbidding edge colorings of finite graphs