Stop the war!
Остановите войну!
for scientists:
default search action
"Recognizing tough graphs is NP-hard."
Douglas Bauer, S. Louis Hakimi, Edward F. Schmeichel (1990)
- Douglas Bauer, S. Louis Hakimi, Edward F. Schmeichel:
Recognizing tough graphs is NP-hard. Discret. Appl. Math. 28(3): 191-195 (1990)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.