Partial duals of plane graphs, separability and the graphs of knots

Details Partial duals of plane graphs, separability and the graphs of knots Partial duals of plane graphs, separability and the graphs of knots

2010-07-23

arxiv.org/abs/1007.4219v2

Mathematics

Combinatorics

v2: major changes

Scientific paper

There is a well-known way to describe a link diagram as a (signed) plane graph, called its Tait graph. This concept was recently extended, providing a way to associate a set of embedded graphs (or ribbon graphs) to a link diagram. While every plane graph arises as a Tait graph of a unique link diagram, not every embedded graph represents a link diagram. Furthermore, although a Tait graph describes a unique link diagram, the same embedded graph can represent many different link diagrams. One is then led to ask which embedded graphs represent link diagrams, and how link diagrams presented by the same embedded graphs are related to one another. Here we answer these questions by characterizing the class of embedded graphs that represent link diagrams, and then using this characterization to find a move that relates all of the link diagrams that are presented by the same set of embedded graphs.

Affiliated with

Also associated with

No associations

Rating

Partial duals of plane graphs, separability and the graphs of knots 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 Partial duals of plane graphs, separability and the graphs of knots, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Partial duals of plane graphs, separability and the graphs of knots will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-368779