[math-fun] Question about graphs

An obvious threorem in simple graph theory says that no graph with no 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, and a reference would be even nicer. Thanks for any info. Steve Gray