scientific article; zbMATH DE number 5995288
From MaRDI portal
Publication:3105545
zbMATH Open1248.05065MaRDI QIDQ3105545FDOQ3105545
Authors: Adam Gouge, D. G. Hoffman, Laura Nunley, Luke Paben, P. D. jun. Johnson 
Publication date: 5 January 2012
Title of this publication is not available (Why is that?)
Recommendations
- Edge Colorings of K(m,n) with m+n-1 Colors Which Forbid Rainbow Cycles
- On rainbow trees and cycles
- On lengths of rainbow cycles
- Anti-Ramsey problems for \(t\) edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees
- A mixed-Ramsey result
- Long directed rainbow cycles and rainbow spanning trees
- A rainbow Erdös-Rothschild problem
- Complete graphs with no rainbow tree
- Complete graphs with no rainbow path
- Vertex-disjoint rainbow cycles in edge-colored graphs
Cited In (13)
- Edge Colorings of K(m,n) with m+n-1 Colors Which Forbid Rainbow Cycles
- Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles
- Local rainbow colorings
- On colorful edge triples in edge-colored complete graphs
- Repeated patterns in proper colorings
- Title not available (Why is that?)
- Periods in missing lengths of rainbow cycles
- Edge-colorings of complete graphs that avoid polychromatic trees
- On rainbow-cycle-forbidding edge colorings of finite graphs
- Complete graphs with no rainbow tree
- 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
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3105545)
