Koh–Rogers–Lee–Toh conjecture on graceful variable windmills
Koh–Rogers–Lee–Toh conjecture on graceful variable windmills
Let be a cycle of length , and let be the graph obtained from the union of copies of with one vertex in common, called the central vertex. A graph is graceful if it has an injective vertex labelling with labels in , where is the number of edges, such that the induced edge labels are exactly . Koh–Rogers–Lee–Toh conjecture. The graph is graceful if and only if
This conjecture characterizes exactly which variable windmills are expected to admit graceful labellings; the supplied text gives no resolution or partial status, so it remains open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Ahmad H. Alkasasbeh, Danny Dyer and Jared Howell, “Graceful labellings of variable windmills using Skolem sequences”, arXiv:2112.04265 (2021).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.