MathSciNet Relay Station
MathSciNet bibliographic data
MR1905640 68R10 (05C85 68Q25)
Patrignani, Maurizio; Pizzonia, Maurizio The complexity of the matching-cut problem. Graph-theoretic concepts in computer science (Boltenhagen, 2001), 284–295, Lecture Notes in Comput. Sci., 2204, Springer, Berlin, 2001.
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.

Username/Password Subscribers access MathSciNet here

AMS Home Page

American Mathematical Society American Mathematical Society
201 Charles Street
Providence, RI 02904-6248 USA
© Copyright 2017, American Mathematical Society
Privacy Statement