A characterization of partially dual graphs
Combinatorics
2012-03-01 v4
Abstract
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result generalizes a well known result of J. Edmonds in which natural duality of graphs is characterized in terms of edge correspondence, and gives a combinatorial characterization of partial duality.
Cite
@article{arxiv.0901.1868,
title = {A characterization of partially dual graphs},
author = {Iain Moffatt},
journal= {arXiv preprint arXiv:0901.1868},
year = {2012}
}
Comments
V2: the statement of the main result has been changed. To appear in JGT.