Balogh, József, Lidický, Bernard, Norin, Sergey, Pfender, Florian, Salazar, Gelasio, and Spiro, Sam. Crossing numbers of complete bipartite graphs. Retrieved from https://par.nsf.gov/biblio/10528799. Procedia Computer Science 223.C Web. doi:10.1016/j.procs.2023.08.216.

Balogh, József, Lidický, Bernard, Norin, Sergey, Pfender, Florian, Salazar, Gelasio, & Spiro, Sam. Crossing numbers of complete bipartite graphs. Procedia Computer Science, 223 (C). Retrieved from https://par.nsf.gov/biblio/10528799. https://doi.org/10.1016/j.procs.2023.08.216

Balogh, József, Lidický, Bernard, Norin, Sergey, Pfender, Florian, Salazar, Gelasio, and Spiro, Sam. "Crossing numbers of complete bipartite graphs". Procedia Computer Science 223 (C). Country unknown/Code not available: Elsevier. https://doi.org/10.1016/j.procs.2023.08.216. https://par.nsf.gov/biblio/10528799.

@article{osti_10528799,
place = {Country unknown/Code not available}, title = {Crossing numbers of complete bipartite graphs}, url = {https://par.nsf.gov/biblio/10528799}, DOI = {10.1016/j.procs.2023.08.216}, abstractNote = {}, journal = {Procedia Computer Science}, volume = {223}, number = {C}, publisher = {Elsevier}, author = {Balogh, József and Lidický, Bernard and Norin, Sergey and Pfender, Florian and Salazar, Gelasio and Spiro, Sam}, }