Triple crossing numbers of graphs

DOI10.13447/J.1674-5647.2016.01.01MaRDI QIDQ2823538zbMATH OpenFDO

Authors Hiroyuki Tanaka, Masakazu Teragaito

Publication date 6 October 2016

Published in Communications in Mathematical Research (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1002.4231

zbMATH Keywords

complete multipartite graphcrossing numbertriple crossing number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Abstract: 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.

Recommendations

• On crossing numbers of complete tripartite and balanced complete multipartite graphs
• Bounding the tripartite‐circle crossing number of complete tripartite graphs
• The crossing number of the complete quadruple graph
• The crossing number of \(K_{1,1,3,n}\).
• Triple crossing number of knots and links

Cited in

(6)

• On 3‐regular graphs having crossing number at least 2
• Turning Knots into Flowers and Related Undergraduate Research
• Multi-crossing number for knots and the Kauffman bracket polynomial
• Triple-crossing number and moves on triple-crossing link diagrams
• Bounding the tripartite‐circle crossing number of complete tripartite graphs
• Bounding the tripartite-circle crossing number of complete tripartite graphs

This page was built for publication: Triple crossing numbers of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2823538)