[seqfan] Re: A conjecture concerning connected rooted strength 1 Eulerian graphs with n nodes
nikos.ap at gmail.com
Fri Mar 13 11:10:08 CET 2009
On Fri, Mar 13, 2009 at 11:02:55AM +0200, thus spake Valery Liskovets:
> Btw, there is a simple bijective transformation of arbitrary n-graphs into
> rooted Eulerian (n+1)-graphs: add an external root-vertex and connect it
> with the odd-valent vertices.
But what if the graph is Eulerian to begin with? Then this construction
just adds one isolated vertex resulting in a disconnected and therefore
not Eulerian graph.
More information about the SeqFan