Journal of Information Processing
Online ISSN : 1882-6652
ISSN-L : 1882-6652
On the Rectilinear Local Crossing Number of Km, n
Bernardo M. ÁbregoKory DondzilaSilvia Fernández-MerchantEvgeniya LagodaSeyed SajjadiYakov Sapozhnikov
Author information
JOURNAL FREE ACCESS

2017 Volume 25 Pages 542-550

Details
Abstract

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 .

Content from these authors
© 2017 by the Information Processing Society of Japan
Previous article Next article
feedback
Top