California State University
2017 Volume 25 Pages 542-550
(compatible with EndNote, Reference Manager, ProCite, RefWorks)
(compatible with BibDesk, LaTeX)
We bound the rectilinear local crossing number of the complete bipartite graph Km, n for every m and n, and completely determine its value when min(m, n) ≤ 4 .
Already have an account? Sign in here