Pages that link to "Item:Q2811196"
From MaRDI portal
The following pages link to Anti-Ramsey Problems for <i>t</i> Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees (Q2811196):
Displaying 13 items.
- Rainbow spanning subgraphs of small diameter in edge-colored complete graphs (Q292270) (← links)
- 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 subgraphs: cycles and matchings (Q2334066) (← links)
- Long rainbow paths and rainbow cycles in edge colored graphs. A survey (Q2422839) (← links)
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees (Q2657096) (← links)
- Anti-Ramsey numbers for trees in complete multi-partite graphs (Q2675857) (← links)
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees (Q5139656) (← 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)
