1
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      The induced matching and chain subgraph cover problems for convex bipartite graphs

      , ,
      Theoretical Computer Science
      Elsevier BV

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Author and article information

          Journal
          Theoretical Computer Science
          Theoretical Computer Science
          Elsevier BV
          03043975
          August 2007
          August 2007
          : 381
          : 1-3
          : 260-265
          Article
          10.1016/j.tcs.2007.04.006
          1a26aa68-03e8-4260-a660-84fa6db3ed50
          © 2007

          https://www.elsevier.com/tdm/userlicense/1.0/

          https://www.elsevier.com/open-access/userlicense/1.0/

          History

          Comments

          Comment on this article