Cyclic permutations in determining crossing numbers

DOI10.7151/dmgt.2351zbMath1493.05078OpenAlexW3084436703MaRDI QIDQ2158197

Marián Klešč, Michal Staš

Publication date: 26 July 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2351

zbMATH Keywords

crossing numbergraph drawingcyclic permutationjoin product

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

The crossing numbers of join products of four graphs of order five with paths and cycles ⋮ Unnamed Item ⋮ On the crossing numbers of join products of W_{4}+P_{n} and W_{4}+C_{n}

Cites Work

• The optimal drawings of \(K_{5,n}\)
• On the crossing numbers of Cartesian products of wheels and trees
• The crossing numbers of join of the special graph on six vertices with path and cycle
• 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 K5,n
• On a problem of P. Turan concerning graphs

This page was built for publication: Cyclic permutations in determining crossing numbers