Isomorphism theorems for even cycles and even cuts in graphs
|Affiliation:||University of Waterloo|
|Room:||Mathematics & Computer Building (MC) 5158|
A seminal result of Whitney characterizes when two graphs have the same cycle space (or equivalently the same cut space): namely, this occurs exactly when one graph can be obtained from the other by repeatedly rearranging the graph along one and two vertex cut sets in a special way. We generalize this result to even cycles in signed graphs as well as to even cuts in grafts.
This is joint work with Irene Pivotto and Paul Wollan.
200 University Avenue West
Waterloo, ON N2L 3G1