Drawing disconnected graphs on the Klein bottle

Details Drawing disconnected graphs on the Klein bottle Drawing disconnected graphs on the Klein bottle

2008-10-02

arxiv.org/abs/0810.0508v2

Mathematics

Combinatorics

13 pages, second version, major changes in the proof

Scientific paper

We prove that two disjoint graphs must always be drawn separately on the
Klein bottle, in order to minimize the crossing number of the whole drawing.

Affiliated with

Also associated with

No associations

Rating

Drawing disconnected graphs on the Klein bottle 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 Drawing disconnected graphs on the Klein bottle, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Drawing disconnected graphs on the Klein bottle will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-493198