The following pages link to An anti-Ramsey theorem (Q5917511):
Displaying 50 items.
- Anti-Ramsey number of matchings in hypergraphs (Q393472) (← links)
- Anti-Ramsey coloring for matchings in complete bipartite graphs (Q512859) (← links)
- Rainbow generalizations of Ramsey theory: A survey (Q604649) (← links)
- The anti-Ramsey number of perfect matching (Q764878) (← links)
- Rainbows in the hypercube (Q879943) (← links)
- Rainbow numbers for graphs containing small cycles (Q897256) (← links)
- On a heterochromatic number for hypercubes (Q932668) (← links)
- Edge-colorings avoiding rainbow and monochromatic subgraphs (Q942100) (← links)
- Improved bounds for rainbow numbers of matchings in plane triangulations (Q1618242) (← links)
- Rainbow number of matchings in planar graphs (Q1660271) (← 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)
- Properly colored \(C_4\)'s in edge-colored graphs (Q2005704) (← links)
- Rainbow triangles and cliques in edge-colored graphs (Q2011150) (← links)
- On the maximal colorings of complete graphs without some small properly colored subgraphs (Q2053693) (← links)
- Anti-Ramsey numbers for cycles in \(n\)-prisms (Q2081461) (← links)
- Anti-Ramsey numbers for vertex-disjoint triangles (Q2092342) (← links)
- An anti-Ramsey theorem of \(k\)-restricted edge-cuts (Q2159228) (← links)
- Improved approximation for maximum edge colouring problem (Q2161229) (← 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 numbers for small graphs in planar graphs (Q2287674) (← links)
- Planar anti-Ramsey numbers of paths and cycles (Q2324510) (← 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)
- Planar anti-Ramsey numbers of matchings (Q2421877) (← links)
- An anti-Ramsey theorem on cycles (Q2573806) (← 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)
- Bipartite anti-Ramsey numbers of cycles (Q3156920) (← links)
- Totally Multicolored diamonds (Q3503558) (← links)
- Anti-Ramsey numbers of doubly edge-critical graphs (Q3652531) (← links)
- Anti-Ramsey theorems (Q4075490) (← links)
- Turán-Ramsey Theorems and <i>K<sub>p</sub></i>-Independence Numbers (Q4314149) (← links)
- Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs (Q5212951) (← links)
- Anti-Ramsey numbers for matchings in regular bipartite graphs (Q5347253) (← links)
- Anti-Ramsey Multiplicities (Q5377035) (← links)
- On totally multicolored stars (Q5469141) (← links)
- Rainbow cliques in edge-colored graphs (Q5964266) (← links)
- On heterochromatic out-directed spanning trees in tournaments (Q5964994) (← links)
- Anti‐Ramsey number of expansions of paths and cycles in uniform hypergraphs (Q6046647) (← links)
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs (Q6046825) (← links)
- Anti-Ramsey problems in the Mycielskian of a cycle (Q6048647) (← links)
- Balanced edge-colorings avoiding rainbow cliques of size four (Q6133158) (← links)
- Anti-Ramsey number of matchings in outerplanar graphs (Q6145814) (← links)
- Anti-Ramsey number of disjoint union of star-like hypergraphs (Q6197696) (← links)
