Pages that link to "Item:Q2732627"
From MaRDI portal
The following pages link to On the anti-Ramsey numbers for spanning trees (Q2732627):
Displaying 11 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 numbers for trees in complete multi-partite graphs (Q2675857) (← links)
- Anti-Ramsey problems for \(t\) edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees (Q2811196) (← links)
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees (Q5139656) (← links)
- On heterochromatic out-directed spanning trees in tournaments (Q5964994) (← links)
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs (Q6100615) (← links)
- Computing the anti-Ramsey number for trees in complete tripartite graph (Q6108022) (← links)