The following pages link to (Q2732627):
Displaying 7 items.
- Anti-Ramsey numbers in complete \(k\)-partite graphs (Q2007338) (← links)
- On the number of heterochromatic trees in nice and beautiful colorings of complete graphs (Q2062897) (← links)
- Anti-Ramsey problems for cycles (Q2243332) (← links)
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings (Q2334066) (← links)
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees (Q2657096) (← links)
- Anti-Ramsey Problems for <i>t</i> Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees (Q2811196) (← links)
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs (Q6100615) (← links)
