Upper bound for the crossing number of Q_n K₃

MaRDI QIDQ4608524zbMATH OpenFDO

Authors Aroonwan Suebsriwichai, T. Mouktonglang

Publication date 21 March 2018

Full work available at URL http://thaijmath.in.cmu.ac.th/index.php/thaijmath/article/view/2607

zbMATH Keywords

crossing numberdrawinggraphhypercube

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The crossing number of \(K_{2,3}{\times}C_{3}\)
• Bounds for the crossing number of the N‐cube
• The maximum rectilinear crossing number of the n dimensional cube graph
• An improved upper bound on the crossing number of the hypercube
• The crossing number ofK1,3,n andK2,3,n

Cites work

• A survey of the theory of hypercube graphs
• An improved upper bound on the crossing number of the hypercube
• Crossing Number is NP-Complete
• Crossing Number Problems

Cited in

(1)

• An upper bound for the crossing number of bubble-sort graph B_n

This page was built for publication: Upper bound for the crossing number of \(Q_n \times K_3\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608524)