Adding random edges to create the square of a Hamilton cycle

MaRDI QIDQ6292278zbMATH OpenFDO

Authors Patrick Bennett, Andrzej Dudek, Alan Frieze

Publication date 7 October 2017

Abstract: We consider how many random edges need to be added to a graph of order $n$ with minimum degree $alphan$ in order that it contains the square of a Hamilton cycle w.h.p..

This page was built for publication: Adding random edges to create the square of a Hamilton cycle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6292278)