4 Feb
2005
4 Feb
'05
12:59 a.m.
Quoting Steve Gray <stevebg@adelphia.net>:
An obvious theorem 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.
Is that so obvious? Anyway, as to the converse --- think of a zillion nodes, all connected in pairs with no other connections. - hvm ------------------------------------------------- www.correo.unam.mx UNAMonos Comunicándonos