On the crossing numbers of join products of five graphs of order six with the discrete graph

DOI10.7494/OpMath.2020.40.3.383zbMath1437.05205OpenAlexW3014349835MaRDI QIDQ5106725

Michal Staš

Publication date: 22 April 2020

Published in: Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7494/opmath.2020.40.3.383

zbMATH Keywords

crossing numbergraph drawingcyclic permutationjoin product

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Unnamed Item

Cites Work

• 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
• The Join of Graphs and Crossing Numbers
• DETERMINING CROSSING NUMBERS OF GRAPHS OF ORDER SIX USING CYCLIC PERMUTATIONS
• The crossing number of K5,n
• The crossing numbers of Cartesian products of paths with 5-vertex graphs

This page was built for publication: On the crossing numbers of join products of five graphs of order six with the discrete graph