Pages that link to "Item:Q4222172"
From MaRDI portal
The following pages link to On the existence of rainbows in 1-factorizations of \(K_{2n}\) (Q4222172):
Displaying 9 items.
- How many colors guarantee a rainbow matching? (Q405108) (← links)
- Maximum transversal in partial Latin squares and rainbow matchings (Q869577) (← links)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
- Minimum number of palettes in edge colorings (Q2014713) (← links)
- Maximum weight edge-constrained matchings (Q2476253) (← links)
- A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph (Q2502039) (← links)
- Rainbow and orthogonal paths in factorizations of<i>K</i><i>n</i> (Q3576975) (← links)
- Rainbow faces in edge‐colored plane graphs (Q3652543) (← links)
- Transversals in generalized Latin squares (Q5225021) (← links)