Pages that link to "Item:Q1883265"

The following pages link to Rainbow numbers for matchings and complete graphs (Q1883265):

Displaying 50 items.

• Anti-Ramsey numbers in complete split graphs (Q279216) (← links)
• Anti-Ramsey numbers of graphs with small connected components (Q292266) (← links)
• Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs (Q383748) (← links)
• Anti-Ramsey number of matchings in hypergraphs (Q393472) (← links)
• Rainbow numbers for matchings in plane triangulations (Q397167) (← links)
• Anti-Ramsey coloring for matchings in complete bipartite graphs (Q512859) (← links)
• Rainbow generalizations of Ramsey theory: A survey (Q604649) (← links)
• The rainbow number of matchings in regular bipartite graphs (Q735110) (← links)
• Rainbows in the hypercube (Q879943) (← links)
• Rainbow numbers for graphs containing small cycles (Q897256) (← links)
• Rainbow numbers for cycles with pendant edges (Q1014810) (← 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)
• 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)
• On the anti-Ramsey numbers of linear forests (Q2005724) (← 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)
• 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 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)
• Rainbow triangles in edge-colored Kneser graphs (Q2284337) (← 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)
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph (Q2502039) (← 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)
• Rainbow numbers for certain graphs (Q3439415) (← links)
• Anti-Ramsey numbers of doubly edge-critical graphs (Q3652531) (← links)
• Rainbow faces in edge‐colored plane graphs (Q3652543) (← links)
• Anti-Ramsey numbers for disjoint copies of graphs (Q4690986) (← links)
• Anti-Ramsey Hypergraph Numbers (Q5061691) (← links)
• Complexity of Computing the Anti-Ramsey Numbers for Paths. (Q5089164) (← links)
• Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs (Q5212951) (← links)
• Anti-Ramsey numbers for matchings in regular bipartite graphs (Q5347253) (← links)
• Rainbow cliques in edge-colored graphs (Q5964266) (← links)