Bounding the tripartite-circle crossing number of complete tripartite graphs

MaRDI QIDQ6621173FDOQ6621173

Authors: C. A. Camacho, Silvia Fernández-Merchant, Rachel Kirsch, Linda Kleist, Marija Jelić Milutinović, Jennifer White 

Publication date: 18 October 2024

Published in: Acta Mathematica Universitatis Comenianae. New Series (Search for Journal in Brave)

Recommendations

• Bounding the tripartite‐circle crossing number of complete tripartite graphs
• On crossing numbers of complete tripartite and balanced complete multipartite graphs
• scientific article; zbMATH DE number 5238993
• Triple crossing numbers of graphs
• A lower bound on the crossing number of the complete tripartite graph \(K_{1,2p+1,2q+1}\).

Mathematics Subject Classification ID

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

Cites Work

• The graph crossing number and its variants: a survey
• Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
• On a problem of P. Turan concerning graphs
• Shellable drawings and the cylindrical crossing number of \(K_n\)
• The crossing number ofK1,3,n andK2,3,n
• Odd crossing number and crossing number are not the same
• Title not available (Why is that?)
• On the Number of Crossings in a Complete Graph
• On crossing numbers of complete tripartite and balanced complete multipartite graphs
• The complexity of computing the cylindrical and the \(t\)-circle crossing number of a graph
• The early history of the brick factory problem
• The 2-page crossing number of \(K_{n}\)
• The crossing number of \(K_{3,3,n}\)

This page was built for publication: Bounding the tripartite-circle crossing number of complete tripartite graphs

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