Determining crossing numbers of the join products of two specific graphs of order six with the discrete graph

DOI10.2298/FIL2009829SzbMath1499.05172MaRDI QIDQ5866213

Michal Staš

Publication date: 13 June 2022

Published in: Filomat (Search for Journal in Brave)

zbMATH Keywords

rotationcrossing numbergraph drawingjoin product

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

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
• Determining crossing number of join of the discrete graph with two symmetric graphs of order five
• The crossing numbers of join products of paths with graphs of order four
• On the crossing number of join of the wheel on six vertices with the discrete graph
• The Join of Graphs and Crossing Numbers
• On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices
• 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 NUMBER OF THE JOIN OF THE WHEEL ON FIVE VERTICES WITH THE DISCRETE GRAPH
• The crossing number of K5,n

This page was built for publication: Determining crossing numbers of the join products of two specific graphs of order six with the discrete graph