Two Analogs of Intrinsically Linked Graphs

Details Two Analogs of Intrinsically Linked Graphs Two Analogs of Intrinsically Linked Graphs

2007-07-24

arxiv.org/abs/0707.3615v1

Mathematics

Geometric Topology

10 pages, 2 figures

Scientific paper

A graph G is intrinsically S^1-linked if for every embedding of the vertices of G into S^1, vertices that form the endpoints of two disjoint edges in G form a non-split link in the embedding. We show that a graph is intrinsically S^1-linked if and only if it is not outer-planar. A graph is outer-flat if it can be embedded in the 3-ball such that all of its vertices map to the boundary of the 3-ball, all edges to the interior, and every cycle bounds a disk in the 3-ball that meets the graph only along its boundary. We show that a graph is outer-flat if and only if it is planar.

Affiliated with

Also associated with

No associations

Rating

Two Analogs of Intrinsically Linked 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 Two Analogs of Intrinsically Linked Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Two Analogs of Intrinsically Linked Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-440913