On rainbow-cycle-forbidding edge colorings of finite graphs
From MaRDI portal
Publication:2287749
Recommendations
Cites work
- Bipartite decomposition of random graphs
- Decomposition of random graphs into complete bipartite graphs
- Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles
- Edge Colorings of K(m,n) with m+n-1 Colors Which Forbid Rainbow Cycles
- scientific article; zbMATH DE number 5995288 (Why is no real title available?)
- More on the bipartite decomposition of random graphs
- On the Addressing Problem for Loop Switching
- Rainbow faces in edge-colored plane graphs
- Rainbow generalizations of Ramsey theory: A survey
Cited in
(11)- Edge-colored complete graphs containing no properly colored odd cycles
- Rainbow and monochromatic circuits and cocircuits in binary matroids
- On sufficient conditions for rainbow cycles in edge-colored graphs
- Note on rainbow cycles in edge-colored graphs
- scientific article; zbMATH DE number 3906522 (Why is no real title available?)
- Rainbow Odd Cycles
- Edge Colorings of K(m,n) with m+n-1 Colors Which Forbid Rainbow Cycles
- Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles
- scientific article; zbMATH DE number 7731161 (Why is no real title available?)
- Proper rainbow-cycle-forbidding edge colorings of graphs
- Forbidding monochromatic odd cycles and rainbow cycles in complete graphs
This page was built for publication: On rainbow-cycle-forbidding edge colorings of finite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287749)