The following pages link to (Q2931471):
Displaying 12 items.
- Anti-Ramsey coloring for matchings in complete bipartite graphs (Q512859) (← links)
- Extremal coloring for the anti-Ramsey problem of matchings in complete graphs (Q1679499) (← links)
- Anti-Ramsey numbers for matchings in 3-regular bipartite graphs (Q1732824) (← links)
- Rainbow matchings in edge-colored complete split graphs (Q1746587) (← links)
- Anti-Ramsey numbers in complete \(k\)-partite graphs (Q2007338) (← links)
- Anti-Ramsey number of matchings in a hypergraph (Q2231708) (← 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 numbers for matchings in regular bipartite graphs (Q5347253) (← links)
- Computing the anti-Ramsey number for trees in complete tripartite graph (Q6108022) (← links)
- Anti-Ramsey number of matchings in outerplanar graphs (Q6145814) (← links)