“Woah! It's like Spotify but for academic articles.”

Instant Access to Thousands of Journals for just $40/month

Get 2 Weeks Free

On the complexity of the approximation of nonplanarity parameters for cubic graphs

On the complexity of the approximation of nonplanarity parameters for cubic graphs Let G =( V , E ) be a simple graph. The NON-PLANAR DELETION problem consists in finding a smallest subset E ′⊂ E such that H =( V , E ⧹ E ′) is a planar graph. The SPLITTING NUMBER problem consists in finding the smallest integer k ⩾0, such that a planar graph H can be defined from G by k vertex splitting operations. We establish the Max SNP-hardness of SPLITTING NUMBER and NON-PLANAR DELETION problems for cubic graphs. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Discrete Applied Mathematics Elsevier
Loading next page...
 
/lp/elsevier/on-the-complexity-of-the-approximation-of-nonplanarity-parameters-for-GeLyiOsb0R

You're reading a free preview. Subscribe to read the entire article.

And millions more from thousands of peer-reviewed journals, for just $40/month

Get 2 Weeks Free

To be the best researcher, you need access to the best research

  • With DeepDyve, you can stop worrying about how much articles cost, or if it's too much hassle to order — it's all at your fingertips. Your research is important and deserves the top content.
  • Read from thousands of the leading scholarly journals from Springer, Elsevier, Nature, IEEE, Wiley-Blackwell and more.
  • All the latest content is available, no embargo periods.

Stop missing out on the latest updates in your field

  • We’ll send you automatic email updates on the keywords and journals you tell us are most important to you.
  • There is a lot of content out there, so we help you sift through it and stay organized.