The following pages link to (Q4075490):
Displaying 39 items.
- Anti-Ramsey numbers in complete split graphs (Q279216) (← links)
- Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721) (← links)
- Anti-Ramsey number of matchings in hypergraphs (Q393472) (← links)
- Rainbow numbers for matchings in plane triangulations (Q397167) (← links)
- Exactly \(m\)-coloured complete infinite subgraphs (Q402596) (← links)
- Anti-Ramsey coloring for matchings in complete bipartite graphs (Q512859) (← links)
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems (Q628313) (← links)
- The rainbow number of matchings in regular bipartite graphs (Q735110) (← links)
- The anti-Ramsey number of perfect matching (Q764878) (← links)
- Mono-multi bipartite Ramsey numbers, designs, and matrices (Q817616) (← links)
- Size and degree anti-Ramsey numbers (Q897241) (← links)
- On a heterochromatic number for hypercubes (Q932668) (← links)
- Edge-colorings avoiding rainbow and monochromatic subgraphs (Q942100) (← links)
- Anti-Ramsey properties of random graphs (Q965256) (← links)
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families (Q966046) (← links)
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361) (← links)
- Bipartite rainbow numbers of matchings (Q1025529) (← links)
- Complete solution for the rainbow numbers of matchings (Q1025962) (← links)
- Improved bounds for rainbow numbers of matchings in plane triangulations (Q1618242) (← links)
- Anti-Ramsey number of Hanoi graphs (Q1630944) (← links)
- Some heterochromatic theorems for matroids (Q1660247) (← links)
- Extremal coloring for the anti-Ramsey problem of matchings in complete graphs (Q1679499) (← links)
- Anti-powers in infinite words (Q1747764) (← links)
- Monochromatic subgraphs in the absence of a properly colored 4-cycle (Q1756081) (← links)
- Anti-Ramsey colorings in several rounds (Q1850529) (← links)
- Anti-Ramsey numbers of subdivided graphs (Q1850619) (← links)
- Rainbow numbers for matchings and complete graphs (Q1883265) (← links)
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs (Q1981664) (← links)
- A large number of \(m\)-coloured complete infinite subgraphs (Q1985446) (← links)
- Properly colored \(C_4\)'s in edge-colored graphs (Q2005704) (← links)
- On the anti-Ramsey numbers of linear forests (Q2005724) (← links)
- Rainbow triangles and cliques in edge-colored graphs (Q2011150) (← links)
- Rainbow connection and graph products (Q2014711) (← links)
- Anti-Ramsey number of triangles in complete multipartite graphs (Q2045396) (← links)
- Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs (Q2073118) (← links)
- Anti-Ramsey number of matchings in \(r\)-partite \(r\)-uniform hypergraphs (Q2075528) (← links)
- Anti-Ramsey numbers for cycles in \(n\)-prisms (Q2081461) (← links)
- Anti-Ramsey numbers for vertex-disjoint triangles (Q2092342) (← links)
- Rainbow cliques in edge-colored graphs (Q5964266) (← links)
