|
|
||
|
|
|
MR1022112
(91d:68054)
68Q25
(05C10 57M15 68R10)
Thomassen, Carsten The graph genus problem is NP-complete. J. Algorithms 10 (1989), no. 4, 568--576. |
|
|
| For users without a MathSciNet license , Relay Station allows linking from MR numbers in online mathematical literature directly to electronic journals and original articles. Subscribers receive the added value of full MathSciNet reviews. | ||||
|
|
||||
AMS Home Page
|