Rainbow perfect matchings and Hamilton cycles in the random geometric graph

DOI10.1002/rsa.20717zbMath1386.05173arXiv1602.05169OpenAlexW2963663072WikidataQ57991415 ScholiaQ57991415MaRDI QIDQ4597602

Xavier Pérez-Giménez, Patrick Bennett, Paweł Prałat, Deepak Bal

Publication date: 13 December 2017

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1602.05169

zbMATH Keywords

rainbowperfect matchingsHamilton cyclesrandom geometric graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Bridged Hamiltonian cycles in sub-critical random geometric graphs ⋮ Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\)

This page was built for publication: Rainbow perfect matchings and Hamilton cycles in the random geometric graph