Pages that link to "Item:Q764878"
From MaRDI portal
The following pages link to The anti-Ramsey number of perfect matching (Q764878):
Displaying 32 items.
- Anti-Ramsey numbers in complete split graphs (Q279216) (← links)
- Anti-Ramsey numbers of graphs with small connected components (Q292266) (← links)
- Anti-Ramsey number of matchings in hypergraphs (Q393472) (← links)
- Improved bounds for rainbow numbers of matchings in plane triangulations (Q1618242) (← links)
- Anti-Ramsey number of Hanoi graphs (Q1630944) (← 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)
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs (Q1981664) (← links)
- Anti-Ramsey numbers in complete \(k\)-partite graphs (Q2007338) (← links)
- Anti-Ramsey numbers for cycles in \(n\)-prisms (Q2081461) (← links)
- Anti-Ramsey numbers for vertex-disjoint triangles (Q2092342) (← links)
- Improved approximation for maximum edge colouring problem (Q2161229) (← links)
- Rainbow matchings in an edge-colored planar bipartite graph (Q2161844) (← links)
- Anti-Ramsey number of matchings in a hypergraph (Q2231708) (← links)
- Rainbow numbers for paths in planar graphs (Q2242061) (← links)
- Anti-Ramsey problems for cycles (Q2243332) (← links)
- Rainbow triangles in edge-colored Kneser graphs (Q2284337) (← links)
- Rainbow numbers for small graphs in planar graphs (Q2287674) (← links)
- On rainbow matchings in plane triangulations (Q2329209) (← 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)
- On the anti-Ramsey number of forests (Q2659067) (← links)
- Exact rainbow numbers for matchings in plane triangulations (Q2659207) (← links)
- Anti-Ramsey Problems for <i>t</i> Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees (Q2811196) (← links)
- Anti-Ramsey numbers for disjoint copies of graphs (Q4690986) (← links)
- Complexity of Computing the Anti-Ramsey Numbers for Paths. (Q5089164) (← 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 Matchings in 3-Uniform Hypergraphs (Q6046825) (← 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)
