Triple crossing numbers of graphs

Details Triple crossing numbers of graphs Triple crossing numbers of graphs

2010-02-23

arxiv.org/abs/1002.4231v2

Mathematics

Combinatorics

34 pages, 53 figures: We reorganized the article and revised some arguments

Scientific paper

We introduce the triple crossing number, a variation of crossing number, of a graph, which is the minimal number of crossing points in all drawings with only triple crossings of the graph. It is defined to be zero for a planar graph, and to be infinite unless a graph admits a drawing with only triple crossings. In this paper, we determine the triple crossing numbers for all complete multipartite graphs including all complete graphs.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-169433