2 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
A prime labeling of a graph labels its vertices bijectively with the integers from one to the number of vertices, so that adjacent vertices receive coprime labels. I prove the Entringer-Tout conjecture that every tree admits a prime labeling, extending the result of Haxell, Pikhurko, and Taraz from sufficiently large t...
A prime labeling of a graph labels its vertices bijectively with the integers from one to the number of vertices, so that adjacent vertices receive coprime labels. I prove the Entringer-Tout conjecture that every tree admits a prime labeling, extending the result of Haxell, Pikhurko, and Taraz from sufficiently large t...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
