Prefer a chat interface with context about you and your work?
Rainbow perfect matchings and Hamilton cycles in the random geometric graph
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 …