3 Feb
2005
3 Feb
'05
11:21 p.m.
Neat question!
=Steve Gray An obvious threorem in simple graph theory says that no graph with no An extra negation may have slipped in here: ^^ more than two nodes of odd order can be drawn in one continuous path. Is there a theorem saying that any graph with two, one, or zero nodes of odd order can always be drawn in one continuous path? A yes/no answer would be nice,
No, not without also requiring the graph to be connected.
and a reference would be even nicer.
I'll have to leave that to the professionals.
Thanks for any info.
"Enjoy"!