Searching for "The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

The complexity of the matching-cut problem for planar graphs and other graph classes
by P. S. Bonsma, Paul Bonsma — 2003 — Proc. WG 2003, LNCS 2880
… The complexity of the matching-cut problem for planar graphs and other graph classes P.S. Bonsma October, 2002 P…
Cited by 2 (0 self) – Add To MetaCart

Sparse cuts, matching-cuts and leafy trees in graphs
by Paul S. Bonsma, Paul S. Bonsma, Paul Simon Bonsma — 2006
… in complete bipartite graphs . . . . . . . . . . . . . 28 3 The complexity of the Matching-Cut problem…
Cited by 3 (1 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB