The crossing number of nearly complete bipartite graphs

DOI10.12386/A20220044MaRDI QIDQ6624122

Shengxiang Lv, Xianglin Zhang, Yu-Xi Wang

Publication date: 25 October 2024

Published in: Acta Mathematica Sinica. Chinese Series (Search for Journal in Brave)

zbMATH Keywords

rotationcomplete bipartite graphdrawingcrossing numberjoin product

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On the crossing numbers of Cartesian products with paths
• The crossing numbers of join of the special graph on six vertices with path and cycle
• The crossing number of \(K_{1,m,n}\)
• A note on the parity of the number of crossings of a graph
• Zarankiewicz's conjecture is finite for each fixed \(m\)
• The crossing numbers of join of special disconnected graph on five vertices with discrete graphs
• The crossing number of \(K_{5,n+1} \setminus e\)
• The crossing number of \(K_{1,4,n}\)
• The crossing numbers of join products of paths with graphs of order four
• Crossing Number is NP-Complete
• The Join of Graphs and Crossing Numbers
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• The crossing number of K₁₁ is 100
• The crossing number of K5,n
• Crossing Number Problems
• On a problem of P. Turan concerning graphs

This page was built for publication: The crossing number of nearly complete bipartite graphs

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