@Article{CMR-32-1,
author = {Tanaka, Hiroyuki and Teragaito, Masakazu},
title = {Triple Crossing Numbers of Graphs},
journal = {Communications in Mathematical Research },
year = {2016},
volume = {32},
number = {1},
pages = {1--38},
abstract = {<p style="text-align: justify;">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.</p>},
issn = {2707-8523},
doi = {https://doi.org/10.13447/j.1674-5647.2016.01.01},
url = {https://global-sci.com/article/81656/triple-crossing-numbers-of-graphs}
}