A characterization of partially dual graphs

From MaRDI portal
Publication:3018073

DOI10.1002/JGT.20525zbMATH Open1232.05059arXiv0901.1868OpenAlexW3101703727MaRDI QIDQ3018073FDOQ3018073


Authors: Iain Moffatt Edit this on Wikidata


Publication date: 21 July 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/0901.1868




Recommendations




Cites Work


Cited In (26)





This page was built for publication: A characterization of partially dual graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3018073)