Kneser Graphs of Triangulations are Hamiltonian
For every $n \geq 5$, we show that the Kneser graph of triangulations of a convex $n$-gon contains a Hamiltonian cycle.
math.CO↗
arXiv subjects
Publications and source records attributed to Anton Molnar.
For every $n \geq 5$, we show that the Kneser graph of triangulations of a convex $n$-gon contains a Hamiltonian cycle.
We show that the Kneser graph of triangulations of a convex $n$-gon has chromatic number $n-2$.