scientific article

zbMath1483.05050MaRDI QIDQ3391044

Michal Staš

Publication date: 28 March 2022

Full work available at URL: https://azjm.org/volumes/1201/pdf/1201-6.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

graphrotationdrawingcrossing numberjoin product

Mathematics Subject Classification ID

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

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The optimal drawings of \(K_{5,n}\)
• The crossing numbers of join of the special graph on six vertices with path and cycle
• The crossing number of join of the generalized Petersen graph \(P(3, 1)\) with path and cycle
• 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
• The crossing number ofK1,3,n andK2,3,n
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• On the crossing number of join product of the discrete graph with special graphs of order five
• On the crossing numbers of join products of five graphs of order six with the discrete graph
• A survey of graphs with known or bounded crossing numbers
• The crossing number of K5,n
• Determining crossing numbers of the join products of two specific graphs of order six with the discrete graph