On the Orchard crossing number of the complete bipartite graphs

zbMATH Open1337.05079arXiv1008.2638MaRDI QIDQ640465FDOQ640465

Authors: Elie Feder, David Garber 

Publication date: 18 October 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: We compute the Orchard crossing number, which is defined in a similar way to the rectilinear crossing number, for the complete bipartite graphs K_{n,n}.

Full work available at URL: https://arxiv.org/abs/1008.2638

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• The Orchard crossing number of an abstract graph
• The outerplanar crossing number of the complete bipartite graph
• On the crossing number of some complete multipartite graphs
• On the Orchard crossing number of prisms, ladders and other related graphs
• On the crossing number of complete graphs
• On the crossing number of complete graphs
• Relations Between Crossing Numbers of Complete and Complete Bipartite Graphs
• Crossing numbers of nearly complete graphs and nearly complete bipartite graphs.
• scientific article; zbMATH DE number 4094839
• The number of crossings in a regular drawing of the complete bipartite graph

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62)

This page was built for publication: On the Orchard crossing number of the complete bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640465)