Year: 2016
Author: Tanaka Hiroyuki, Teragaito Masakazu
Communications in Mathematical Research , Vol. 32 (2016), Iss. 1 : pp. 1–38
Abstract
We introduce the triple crossing number, a variation of the crossing number, of a graph, which is the minimal number of crossing points in all drawings of the graph with only triple crossings. It is defined to be zero for planar graphs, and to be infinite for non-planar graphs which do not admit a drawing with only triple crossings. In this paper, we determine the triple crossing numbers for all complete multipartite graphs which include all complete graphs.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/10.13447/j.1674-5647.2016.01.01
Communications in Mathematical Research , Vol. 32 (2016), Iss. 1 : pp. 1–38
Published online: 2016-01
AMS Subject Headings: Global Science Press
Copyright: COPYRIGHT: © Global Science Press
Pages: 38
Keywords: crossing number triple crossing number complete multipartite graph.