You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Chapter title |
The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes
|
---|---|
Chapter number | 9 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, June 2003
|
DOI | 10.1007/978-3-540-39890-5_9 |
Book ISBNs |
978-3-54-020452-7, 978-3-54-039890-5
|
Authors |
Paul Bonsma, Bonsma, Paul |