On problems of \(\mathcal{CF}\)-connected graphs for \(K_{m,n}\)

Authors

  • M. Staš Department of Mathematics and Theoretical Informatics, Faculty of Electrical Engineering and Informatics, Technical University of KoÅ¡ice http://orcid.org/0000-0002-2837-8879
  • J. Valiska KMTI FEI TUKE

Keywords:

crossing number, optimal drawing, crossing sequence, complete bipartite graph

Abstract

http://dx.doi.org/10.1017/S0004972712000330

Published

2021-09-08

Issue

Section

Articles