Pages that link to "Item:Q2334066"
From MaRDI portal
The following pages link to Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings (Q2334066):
Displaying 13 items.
- Anti-Ramsey number of triangles in complete multipartite graphs (Q2045396) (← links)
- Rainbow matchings in an edge-colored planar bipartite graph (Q2161844) (← links)
- Anti-Ramsey number of matchings in a hypergraph (Q2231708) (← links)
- Anti-Ramsey problems for cycles (Q2243332) (← links)
- Rainbow triangles in edge-colored Kneser graphs (Q2284337) (← links)
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees (Q2657096) (← links)
- Anti-Ramsey problems for \(t\) edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees (Q2811196) (← links)
- Bipartite anti-Ramsey numbers of cycles (Q3156920) (← links)
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs (Q6100615) (← links)
- Anti-Ramsey number of matchings in outerplanar graphs (Q6145814) (← links)
- Anti-Ramsey number for perfect matchings in 3-regular bipartite graphs (Q6542038) (← links)
- Rainbow disjoint union of \(P_4\) and a matching in complete graphs (Q6585524) (← links)
- Monochromatic graph decompositions inspired by anti-Ramsey colorings (Q6671396) (← links)