Alex Li

Hamilton Cycles and Paths in the Noncrossing Partition Refinement Graph

Let NCR(n) be the cover graph of the refinement order on the noncrossing partitions of an n-element cyclically ordered set. We determine exactly when this graph has a Hamilton cycle and when it has a Hamilton path. The graph has a Hamilton cycle exactly for n in {0,1} or even n a...