We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Rainbow perfect matchings and Hamilton cycles in the random geometric graph.
- Authors
Bal, Deepak; Bennett, Patrick; Pérez-Giménez, Xavier; Prałat, Paweł
- Abstract
Given a graph on n vertices and an assignment of colours to the edges, a rainbow Hamilton cycle is a cycle of length n visiting each vertex once and with pairwise different colours on the edges. Similarly (for even n) a rainbow perfect matching is a collection of
- Subjects
HAMILTON'S equations; GEOMETRIC vertices; UNIFORM distribution (Probability theory); PAIRED comparisons (Mathematics); RANDOM graphs
- Publication
Random Structures & Algorithms, 2017, Vol 51, Issue 4, p587
- ISSN
1042-9832
- Publication type
Article
- DOI
10.1002/rsa.20717