Bound for the 2-page fixed linear crossing number of hypercube graph via SDP relaxation

DOI10.1155/2017/7640347zbMath1437.05063OpenAlexW2613513459WikidataQ59145185 ScholiaQ59145185MaRDI QIDQ670454

T. Mouktonglang, A. Suebsriwichai

Publication date: 18 March 2019

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2017/7640347

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• On crossing numbers of hypercubes and cube connected cycles
• Lectures on Modern Convex Optimization
• Improved Lower Bounds for the 2-Page Crossing Numbers of $K_{m,n}$ and $K_n$ via Semidefinite Programming
• Crossing Number is NP-Complete
• Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
• An improved upper bound on the crossing number of the hypercube
• Crossing Number Problems

This page was built for publication: Bound for the 2-page fixed linear crossing number of hypercube graph via SDP relaxation