Pages that link to "Item:Q1028829"
From MaRDI portal
The following pages link to A rainbow \(k\)-matching in the complete graph with \(r\) colors (Q1028829):
Displaying 27 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)
- Rainbow generalizations of Ramsey theory: A survey (Q604649) (← links)
- The anti-Ramsey number of perfect matching (Q764878) (← links)
- Rainbow matchings of size \(m\) in graphs with total color degree at least \(2mn\) (Q783076) (← links)
- Rainbow numbers for graphs containing small cycles (Q897256) (← links)
- Improved bounds for rainbow numbers of matchings in plane triangulations (Q1618242) (← links)
- Anti-Ramsey number of Hanoi graphs (Q1630944) (← links)
- A rainbow about \(T\)-colorings for complete graphs (Q1918544) (← 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 numbers for paths in planar graphs (Q2242061) (← links)
- Rainbow numbers for small graphs in planar graphs (Q2287674) (← links)
- Quadratic vertex kernel for rainbow matching (Q2300725) (← links)
- On rainbow matchings in plane triangulations (Q2329209) (← links)
- Exact rainbow numbers for matchings in plane triangulations (Q2659207) (← links)
- Almost color-balanced perfect matchings in color-balanced complete graphs (Q2666593) (← links)
- Anti-Ramsey problems for \(t\) edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees (Q2811196) (← links)
- Anti-Ramsey numbers for disjoint copies of graphs (Q4690986) (← links)
- Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs (Q5212951) (← links)
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs (Q6046825) (← links)
- A rainbow about T-colorings for complete graphs (Q6143976) (← links)
- Rainbow short linear forests in edge-colored complete graph (Q6657254) (← links)
