Crossing Number of Graphs with Rotation Systems

We show that computing the crossing number of a graph with a given rotation system is NP-complete. This result leads to a new and much simpler proof of Hlinˇen´y’s result, that computing the crossing number of a cubic graph (no rotation system) is NP-complete.

• Type: Conference
• Year: 2007
• Where: GD
• Authors: Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic
• Keywords: Computer Graphics, GD 2007, Rotation System, Simpler Proof