Bipartite partial duals and circuits in medial graphs

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

v2: minor changes. To appear in Combinatorica

Scientific paper

It is well known that a plane graph is Eulerian if and only if its geometric
dual is bipartite. We extend this result to partial duals of plane graphs. We
then characterize all bipartite partial duals of a plane graph in terms of
oriented circuits in its medial graph.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Bipartite partial duals and circuits in medial 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 Bipartite partial duals and circuits in medial graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bipartite partial duals and circuits in medial graphs will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-178554

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.