The crossing number ofK1,3,n andK2,3,n

DOI10.1002/JGT.3190100102zbMath0586.05014OpenAlexW1814261885MaRDI QIDQ3712347

Kouhei Asano

Publication date: 1986

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190100102

zbMATH Keywords

lower boundcrossing number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (23)

Two recursive inequalities for crossing numbers of graphs ⋮ The crossing numbers of join of some graphs with \(n\) isolated vertices ⋮ The crossing numbers of products of paths and stars with 4‐vertex graphs ⋮ Bounding the tripartite‐circle crossing number of complete tripartite graphs ⋮ Some properties of non-commutative multiplication rings ⋮ Shallow Minors, Graph Products, and Beyond-Planar Graphs ⋮ On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Drawing complete multipartite graphs on the plane with restrictions on crossings ⋮ On the crossing numbers of \(K_m\square C_n\) and \(K_{m,l}\square P_n\) ⋮ On the crossing numbers of Cartesian products of wheels and trees ⋮ The crossing number of \(K_{1,4,n}\) ⋮ The crossing numbers of join of the special graph on six vertices with path and cycle ⋮ The crossing number of \(K_{1,m,n}\) ⋮ The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holds ⋮ A survey of graphs with known or bounded crossing numbers ⋮ ON THE CROSSING NUMBER OF THE CARTESIAN PRODUCT OF A SUNLET GRAPH AND A STAR GRAPH ⋮ Fan-Planar Graphs ⋮ Drawing graph joins in the plane with restrictions on crossings ⋮ Fan-planarity: properties and complexity ⋮ The Join of Graphs and Crossing Numbers ⋮ Determining crossing numbers of the join products of two specific graphs of order six with the discrete graph

This page was built for publication: The crossing number ofK1,3,n andK2,3,n