Subscribe to thousands of academic journals for just $40/month
Read and share the articles you need for your research, all in one place.

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

Discrete Applied Mathematics , Volume 141 (1) – May 30, 2004

Details

Publisher
North-Holland
Copyright
Copyright © 2003 Elsevier B.V.
ISSN
0166-218X
D.O.I.
10.1016/S0166-218X(03)00370-6
Publisher site
See Article on Publisher Site
Expand Tray Hide Tray
Loading next page...

End of preview. The entire article is 16 pages. Rent for Free

You're using the new DeepDyve HTML5 Viewer. Having issues? Try Classic Viewer
 
/lp/elsevier/on-the-complexity-of-the-approximation-of-nonplanarity-parameters-for-GeLyiOsb0R

Loading...