Every tree with at most 34 vertices is prime

Abstract

A graph of order n is called prime if we can bijectively label its vertices with {1,..., n} so that any two adjacent vertices receive coprime labels. Entringer conjectured that any tree is prime. Here we verify this conjecture for alt trees with at most 34 vertices. Our proof does not utilize computer search.