Conjecture 2: Every connected vertex-transitive graph contains a spanning tree of maximum degree 3. It is easy to see that Lovasz' conjecture implies Conjecture 1, and that the latter implies ...