A characterization of partially dual graphs

Details A characterization of partially dual graphs A characterization of partially dual graphs

2009-01-13

arxiv.org/abs/0901.1868v4

J. Graph Theory, 67 (2011) 198-217

Mathematics

Combinatorics

V2: the statement of the main result has been changed. To appear in JGT.

Scientific paper

10.1002/jgt.20525

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.

Affiliated with

Also associated with

No associations

Rating

A characterization of partially dual graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A characterization of partially dual graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A characterization of partially dual graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-374412