Bound for the 2-Page Fixed Linear Crossing Number of Hypercube Graph via SDP Relaxation

• المؤلفون الرئيسيون: Suebsriwichai A., Mouktonglang T.
• التنسيق: دورية
• منشور في: 2017
• الوصول للمادة أونلاين: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85019549547&origin=inward; http://cmuir.cmu.ac.th/jspui/handle/6653943832/40873
• المؤسسة: Chiang Mai University

© 2017 A. Suebsriwichai and T. Mouktonglang. The crossing number of graph G is the minimum number of edges crossing in any drawing of G in a plane. In this paper we describe a method of finding the bound of 2-page fixed linear crossing number of G. We consider a conflict graph G′ of G. Then, instead...